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.r135-tall-171631131000387.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 greatspnxred
Input is DiscoveryGPU-PT-07b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131000387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 01:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 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 54K 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-07b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716360967147

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 06:56:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 06:56:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:56:08] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-22 06:56:08] [INFO ] Transformed 212 places.
[2024-05-22 06:56:08] [INFO ] Transformed 224 transitions.
[2024-05-22 06:56:08] [INFO ] Found NUPN structural information;
[2024-05-22 06:56:08] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 199 transition count 224
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 40 place count 172 transition count 197
Iterating global reduction 1 with 27 rules applied. Total rules applied 67 place count 172 transition count 197
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 73 place count 166 transition count 191
Iterating global reduction 1 with 6 rules applied. Total rules applied 79 place count 166 transition count 191
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 84 place count 161 transition count 186
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 161 transition count 186
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 158 transition count 183
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 158 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 155 transition count 177
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 155 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 152 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 152 transition count 174
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 150 transition count 172
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 150 transition count 172
Applied a total of 111 rules in 82 ms. Remains 150 /212 variables (removed 62) and now considering 172/224 (removed 52) transitions.
// Phase 1: matrix 172 rows 150 cols
[2024-05-22 06:56:08] [INFO ] Computed 2 invariants in 18 ms
[2024-05-22 06:56:08] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-22 06:56:08] [INFO ] Invariant cache hit.
[2024-05-22 06:56:09] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-22 06:56:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 172/321 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-22 06:56:11] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 17 ms to minimize.
[2024-05-22 06:56:11] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 06:56:11] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-22 06:56:11] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:56:12] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 17/168 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 1/322 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/322 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 169 constraints, problems are : Problem set: 0 solved, 171 unsolved in 7598 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 172/321 variables, 149/168 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 170/338 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 340 constraints, problems are : Problem set: 0 solved, 171 unsolved in 10581 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 17/17 constraints]
After SMT, in 18281ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 18300ms
Starting structural reductions in LTL mode, iteration 1 : 150/212 places, 172/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18802 ms. Remains : 150/212 places, 172/224 transitions.
Support contains 29 out of 150 places after structural reductions.
[2024-05-22 06:56:27] [INFO ] Flatten gal took : 45 ms
[2024-05-22 06:56:27] [INFO ] Flatten gal took : 20 ms
[2024-05-22 06:56:27] [INFO ] Input system was already deterministic with 172 transitions.
Support contains 28 out of 150 places (down from 29) after GAL structural reductions.
RANDOM walk for 40000 steps (176 resets) in 904 ms. (44 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40004 steps (35 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
[2024-05-22 06:56:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/60 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/65 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/70 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 166/236 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 81/317 variables, 55/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/322 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/322 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/60 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/65 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/70 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 166/236 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 81/317 variables, 55/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Int declared 322/322 variables, and 153 constraints, problems are : Problem set: 1 solved, 0 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 315ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 286 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 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)||(G(p1)&&F(p0))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 172
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 137 transition count 160
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 137 transition count 160
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 132 transition count 154
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 132 transition count 154
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 129 transition count 150
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 129 transition count 150
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 126 transition count 147
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 126 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 125 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 125 transition count 146
Applied a total of 49 rules in 13 ms. Remains 125 /150 variables (removed 25) and now considering 146/172 (removed 26) transitions.
// Phase 1: matrix 146 rows 125 cols
[2024-05-22 06:56:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 06:56:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 06:56:28] [INFO ] Invariant cache hit.
[2024-05-22 06:56:28] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-22 06:56:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/271 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 06:56:30] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:56:30] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:56:30] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:56:30] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:56:30] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:56:30] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 06:56:30] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:56:30] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-22 06:56:31] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:56:31] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-22 06:56:31] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 138 constraints, problems are : Problem set: 0 solved, 145 unsolved in 4506 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/271 variables, 125/138 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 145/283 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 283 constraints, problems are : Problem set: 0 solved, 145 unsolved in 4507 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 11/11 constraints]
After SMT, in 9069ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 9073ms
Starting structural reductions in LTL mode, iteration 1 : 125/150 places, 146/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9237 ms. Remains : 125/150 places, 146/172 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 248 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 21 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-00 finished in 10177 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' '!((p0 U X(X(p1))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 136 transition count 159
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 136 transition count 159
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 132 transition count 154
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 132 transition count 154
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 130 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 130 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 128 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 128 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 127 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 127 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 126 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 126 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 125 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 125 transition count 146
Applied a total of 49 rules in 9 ms. Remains 125 /150 variables (removed 25) and now considering 146/172 (removed 26) transitions.
// Phase 1: matrix 146 rows 125 cols
[2024-05-22 06:56:38] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 06:56:38] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 06:56:38] [INFO ] Invariant cache hit.
[2024-05-22 06:56:38] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-22 06:56:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/271 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 06:56:40] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:56:40] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:56:40] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:56:40] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:56:40] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:56:40] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:56:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 4 ms to minimize.
[2024-05-22 06:56:40] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:56:40] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:56:40] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:56:41] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:56:41] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2024-05-22 06:56:41] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:56:41] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:56:41] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:56:41] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 16/143 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 143 constraints, problems are : Problem set: 0 solved, 145 unsolved in 4478 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/271 variables, 125/143 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 145/288 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 288 constraints, problems are : Problem set: 0 solved, 145 unsolved in 4478 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 16/16 constraints]
After SMT, in 9010ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 9014ms
Starting structural reductions in LTL mode, iteration 1 : 125/150 places, 146/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9236 ms. Remains : 125/150 places, 146/172 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 72 ms.
Product exploration explored 100000 steps with 33333 reset in 80 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 250 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-03 finished in 9676 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||G(p1)||(p1&&F(G(p2)))))))'
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 172
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 138 transition count 161
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 138 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 135 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 135 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 133 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 133 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 131 transition count 153
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 131 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 129 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 129 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 128 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 128 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 127 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 127 transition count 148
Applied a total of 45 rules in 12 ms. Remains 127 /150 variables (removed 23) and now considering 148/172 (removed 24) transitions.
// Phase 1: matrix 148 rows 127 cols
[2024-05-22 06:56:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 06:56:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 06:56:48] [INFO ] Invariant cache hit.
[2024-05-22 06:56:48] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-22 06:56:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/275 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 5 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-22 06:56:50] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 16/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 145 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4627 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/275 variables, 127/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 147/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 292 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4671 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 16/16 constraints]
After SMT, in 9338ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 9340ms
Starting structural reductions in LTL mode, iteration 1 : 127/150 places, 148/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9493 ms. Remains : 127/150 places, 148/172 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-06
Product exploration explored 100000 steps with 1296 reset in 207 ms.
Product exploration explored 100000 steps with 1327 reset in 286 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 252 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 133 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (172 resets) in 157 ms. (253 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40002 steps (12 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
[2024-05-22 06:56:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/80 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 165/245 variables, 86/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/271 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/275 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/275 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/80 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 165/245 variables, 86/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/271 variables, 21/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/275 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:56:59] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:56:59] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:56:59] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
Problem apf2 is UNSAT
After SMT solving in domain Int declared 275/275 variables, and 133 constraints, problems are : Problem set: 1 solved, 0 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 306ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 p2))), (X (X p1)), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (OR p0 p1 (NOT p2))))]
Knowledge based reduction with 15 factoid took 253 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-22 06:56:59] [INFO ] Invariant cache hit.
[2024-05-22 06:56:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 06:56:59] [INFO ] Invariant cache hit.
[2024-05-22 06:56:59] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-22 06:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/275 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:57:01] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:57:02] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:02] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:57:02] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 16/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 145 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/275 variables, 127/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 147/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 292 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4566 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 16/16 constraints]
After SMT, in 9093ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 9095ms
Finished structural reductions in LTL mode , in 1 iterations and 9228 ms. Remains : 127/127 places, 148/148 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 252 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (171 resets) in 102 ms. (388 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
[2024-05-22 06:57:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/80 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 165/245 variables, 86/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/271 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/275 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/275 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/80 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 165/245 variables, 86/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/271 variables, 21/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/275 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 06:57:09] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:57:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:57:09] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:57:09] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:57:09] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
Problem apf4 is UNSAT
After SMT solving in domain Int declared 275/275 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 410ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) p1))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 291 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1313 reset in 169 ms.
Product exploration explored 100000 steps with 1333 reset in 183 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 148/148 transitions.
Graph (complete) has 252 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 126 transition count 147
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 14 place count 126 transition count 147
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 36 place count 126 transition count 147
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 55 place count 126 transition count 153
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 123 transition count 150
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 123 transition count 150
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 74 place count 123 transition count 176
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 119 transition count 168
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 119 transition count 168
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 93 place count 108 transition count 149
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 104 place count 108 transition count 149
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 102 transition count 139
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 102 transition count 139
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 100 transition count 137
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 100 transition count 137
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 96 transition count 131
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 96 transition count 131
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 136 place count 88 transition count 119
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 144 place count 88 transition count 119
Deduced a syphon composed of 44 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 152 place count 88 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 156 place count 84 transition count 107
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 160 place count 84 transition count 107
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 160 rules in 62 ms. Remains 84 /127 variables (removed 43) and now considering 107/148 (removed 41) transitions.
[2024-05-22 06:57:10] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-22 06:57:10] [INFO ] Flow matrix only has 102 transitions (discarded 5 similar events)
// Phase 1: matrix 102 rows 84 cols
[2024-05-22 06:57:10] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 06:57:10] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-22 06:57:11] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-22 06:57:11] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 103 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 4 (OVERLAPS) 101/185 variables, 84/88 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 46/134 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/134 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 1/186 variables, 1/135 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/135 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/135 constraints. Problems are: Problem set: 51 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 135 constraints, problems are : Problem set: 51 solved, 55 unsolved in 1999 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 51 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 4/47 variables, 2/2 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/4 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 96/143 variables, 47/51 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 45/96 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 55/151 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/151 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 40/183 variables, 36/187 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/187 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 2/185 variables, 2/189 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/189 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 1/186 variables, 1/190 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 0/190 constraints. Problems are: Problem set: 51 solved, 55 unsolved
At refinement iteration 14 (OVERLAPS) 0/186 variables, 0/190 constraints. Problems are: Problem set: 51 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 190 constraints, problems are : Problem set: 51 solved, 55 unsolved in 1507 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 55/106 constraints, Known Traps: 2/2 constraints]
After SMT, in 3523ms problems are : Problem set: 51 solved, 55 unsolved
Search for dead transitions found 51 dead transitions in 3525ms
Found 51 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 51 transitions
Dead transitions reduction (with SMT) removed 51 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 84/127 places, 56/148 transitions.
Graph (complete) has 119 edges and 84 vertex of which 44 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 44 /84 variables (removed 40) and now considering 56/56 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/127 places, 56/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3604 ms. Remains : 44/127 places, 56/148 transitions.
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 148/148 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 127 cols
[2024-05-22 06:57:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 06:57:14] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 06:57:14] [INFO ] Invariant cache hit.
[2024-05-22 06:57:14] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-22 06:57:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/275 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:16] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 16/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/275 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 145 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4599 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/275 variables, 127/145 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 147/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 292 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4509 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 16/16 constraints]
After SMT, in 9140ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 9142ms
Finished structural reductions in LTL mode , in 1 iterations and 9289 ms. Remains : 127/127 places, 148/148 transitions.
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-06 finished in 35451 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)))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 172
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 135 transition count 158
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 135 transition count 158
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 130 transition count 152
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 130 transition count 152
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 127 transition count 148
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 127 transition count 148
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 124 transition count 145
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 124 transition count 145
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 122 transition count 142
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 122 transition count 142
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 121 transition count 141
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 121 transition count 141
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 120 transition count 140
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 120 transition count 140
Applied a total of 59 rules in 13 ms. Remains 120 /150 variables (removed 30) and now considering 140/172 (removed 32) transitions.
// Phase 1: matrix 140 rows 120 cols
[2024-05-22 06:57:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 06:57:23] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 06:57:23] [INFO ] Invariant cache hit.
[2024-05-22 06:57:24] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-05-22 06:57:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/260 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-22 06:57:25] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:57:26] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:57:26] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-22 06:57:26] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 15/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 137 constraints, problems are : Problem set: 0 solved, 139 unsolved in 4054 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/260 variables, 120/137 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 139/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 276 constraints, problems are : Problem set: 0 solved, 139 unsolved in 3936 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 15/15 constraints]
After SMT, in 8023ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 8024ms
Starting structural reductions in LTL mode, iteration 1 : 120/150 places, 140/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8244 ms. Remains : 120/150 places, 140/172 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-07
Product exploration explored 100000 steps with 969 reset in 146 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-07 finished in 8475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Graph (complete) has 286 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 145 transition count 142
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 119 transition count 142
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 53 place count 119 transition count 126
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 85 place count 103 transition count 126
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 90 place count 98 transition count 121
Iterating global reduction 2 with 5 rules applied. Total rules applied 95 place count 98 transition count 121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 95 place count 98 transition count 119
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 96 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 94 transition count 117
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 94 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 92 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 92 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 91 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 91 transition count 113
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 183 place count 54 transition count 76
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 188 place count 49 transition count 66
Iterating global reduction 2 with 5 rules applied. Total rules applied 193 place count 49 transition count 66
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 197 place count 45 transition count 61
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 45 transition count 61
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 41 transition count 54
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 41 transition count 54
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 37 transition count 49
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 37 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 221 place count 33 transition count 42
Iterating global reduction 2 with 4 rules applied. Total rules applied 225 place count 33 transition count 42
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 229 place count 29 transition count 37
Iterating global reduction 2 with 4 rules applied. Total rules applied 233 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 28 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 28 transition count 36
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 236 place count 28 transition count 35
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 28 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 26 transition count 33
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 29 edges and 24 vertex of which 21 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 8 rules applied. Total rules applied 247 place count 21 transition count 25
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 252 place count 16 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 260 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 262 place count 12 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 265 place count 9 transition count 16
Applied a total of 265 rules in 31 ms. Remains 9 /150 variables (removed 141) and now considering 16/172 (removed 156) transitions.
[2024-05-22 06:57:32] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2024-05-22 06:57:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 06:57:32] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-22 06:57:32] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2024-05-22 06:57:32] [INFO ] Invariant cache hit.
[2024-05-22 06:57:32] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-22 06:57:32] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-22 06:57:32] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2024-05-22 06:57:32] [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) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/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 56 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) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4/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 47 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/150 places, 16/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 9/150 places, 16/172 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-09 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Graph (complete) has 286 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 145 transition count 143
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 120 transition count 143
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 51 place count 120 transition count 127
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 83 place count 104 transition count 127
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 88 place count 99 transition count 122
Iterating global reduction 2 with 5 rules applied. Total rules applied 93 place count 99 transition count 122
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 93 place count 99 transition count 120
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 97 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 96 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 96 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 95 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 95 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 94 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 94 transition count 116
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 181 place count 55 transition count 77
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 50 transition count 67
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 50 transition count 67
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 196 place count 45 transition count 61
Iterating global reduction 2 with 5 rules applied. Total rules applied 201 place count 45 transition count 61
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 40 transition count 52
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 40 transition count 52
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 216 place count 35 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 221 place count 35 transition count 46
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 226 place count 30 transition count 37
Iterating global reduction 2 with 5 rules applied. Total rules applied 231 place count 30 transition count 37
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 236 place count 25 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 241 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 242 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 24 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 245 place count 24 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 247 place count 22 transition count 26
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 20 vertex of which 17 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 254 place count 17 transition count 19
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 259 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 260 place count 12 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 264 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 8 transition count 13
Applied a total of 267 rules in 33 ms. Remains 8 /150 variables (removed 142) and now considering 13/172 (removed 159) transitions.
[2024-05-22 06:57:32] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2024-05-22 06:57:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 06:57:32] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 06:57:32] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2024-05-22 06:57:32] [INFO ] Invariant cache hit.
[2024-05-22 06:57:32] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-22 06:57:32] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 06:57:32] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2024-05-22 06:57:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/17 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 51 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/17 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 51 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/150 places, 13/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 8/150 places, 13/172 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-11 finished in 249 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 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Graph (complete) has 286 edges and 150 vertex of which 148 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 147 transition count 143
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 121 transition count 143
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 53 place count 121 transition count 128
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 83 place count 106 transition count 128
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 87 place count 102 transition count 124
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 102 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 91 place count 102 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 100 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 99 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 99 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 98 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 98 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 97 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 97 transition count 118
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 181 place count 57 transition count 78
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 186 place count 52 transition count 68
Iterating global reduction 2 with 5 rules applied. Total rules applied 191 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 48 transition count 63
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 48 transition count 63
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 44 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 44 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 211 place count 40 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 40 transition count 51
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 219 place count 36 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 223 place count 36 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 227 place count 32 transition count 39
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 32 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 31 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 31 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 235 place count 31 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 237 place count 29 transition count 34
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 30 edges and 27 vertex of which 24 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
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 2 with 10 rules applied. Total rules applied 247 place count 24 transition count 24
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 255 place count 17 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 256 place count 16 transition count 23
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 5 with 6 rules applied. Total rules applied 262 place count 13 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 263 place count 13 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 266 place count 10 transition count 16
Applied a total of 266 rules in 26 ms. Remains 10 /150 variables (removed 140) and now considering 16/172 (removed 156) transitions.
[2024-05-22 06:57:32] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 10 cols
[2024-05-22 06:57:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 06:57:32] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 06:57:32] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-05-22 06:57:32] [INFO ] Invariant cache hit.
[2024-05-22 06:57:32] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-22 06:57:32] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-22 06:57:32] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-05-22 06:57:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/22 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 10 constraints, problems are : Problem set: 0 solved, 10 unsolved in 53 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 5/22 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 54 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/150 places, 16/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 10/150 places, 16/172 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-14 finished in 242 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)))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 172
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 137 transition count 160
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 137 transition count 160
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 133 transition count 155
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 133 transition count 155
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 130 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 130 transition count 151
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 127 transition count 148
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 127 transition count 148
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 125 transition count 145
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 125 transition count 145
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 124 transition count 144
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 124 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 123 transition count 143
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 123 transition count 143
Applied a total of 53 rules in 14 ms. Remains 123 /150 variables (removed 27) and now considering 143/172 (removed 29) transitions.
// Phase 1: matrix 143 rows 123 cols
[2024-05-22 06:57:33] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 06:57:33] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 06:57:33] [INFO ] Invariant cache hit.
[2024-05-22 06:57:33] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-22 06:57:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/266 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 06:57:34] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:57:34] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:57:34] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:57:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:57:34] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:57:34] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 06:57:35] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 06:57:35] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 06:57:35] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:57:35] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 06:57:35] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 06:57:35] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 06:57:35] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 06:57:35] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-22 06:57:35] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 15/140 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 140 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/266 variables, 123/140 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 142/282 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 282 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4445 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 15/15 constraints]
After SMT, in 8697ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 8698ms
Starting structural reductions in LTL mode, iteration 1 : 123/150 places, 143/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8836 ms. Remains : 123/150 places, 143/172 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Graph (complete) has 245 edges and 123 vertex of which 122 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-15 finished in 9178 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||G(p1)||(p1&&F(G(p2)))))))'
Found a Shortening insensitive property : DiscoveryGPU-PT-07b-LTLCardinality-06
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 150 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 150/150 places, 172/172 transitions.
Graph (complete) has 286 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 145 transition count 146
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 123 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 122 transition count 145
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 47 place count 122 transition count 129
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 79 place count 106 transition count 129
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 103 transition count 126
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 103 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 85 place count 103 transition count 125
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 102 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 100 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 100 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 98 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 98 transition count 120
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 97 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 97 transition count 119
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 169 place count 61 transition count 83
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 173 place count 57 transition count 75
Iterating global reduction 3 with 4 rules applied. Total rules applied 177 place count 57 transition count 75
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 180 place count 54 transition count 71
Iterating global reduction 3 with 3 rules applied. Total rules applied 183 place count 54 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 185 place count 52 transition count 68
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 52 transition count 68
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 189 place count 50 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 191 place count 50 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 193 place count 48 transition count 62
Iterating global reduction 3 with 2 rules applied. Total rules applied 195 place count 48 transition count 62
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 197 place count 46 transition count 59
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 46 transition count 59
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 45 transition count 58
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 45 transition count 58
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 204 place count 45 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 43 transition count 56
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 68 edges and 42 vertex of which 41 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 210 place count 41 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 212 place count 39 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 224 place count 33 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 32 transition count 47
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 231 place count 27 transition count 42
Applied a total of 231 rules in 27 ms. Remains 27 /150 variables (removed 123) and now considering 42/172 (removed 130) transitions.
[2024-05-22 06:57:42] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
// Phase 1: matrix 37 rows 27 cols
[2024-05-22 06:57:42] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 06:57:42] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 06:57:42] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-22 06:57:42] [INFO ] Invariant cache hit.
[2024-05-22 06:57:42] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-22 06:57:42] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2024-05-22 06:57:42] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-22 06:57:42] [INFO ] Invariant cache hit.
[2024-05-22 06:57:42] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 36/58 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 32 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/63 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/63 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/64 variables, and 45 constraints, problems are : Problem set: 0 solved, 32 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 36/58 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 30/70 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 5/63 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/63 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/64 variables, and 77 constraints, problems are : Problem set: 0 solved, 32 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 603ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 603ms
Starting structural reductions in LI_LTL mode, iteration 1 : 27/150 places, 42/172 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 701 ms. Remains : 27/150 places, 42/172 transitions.
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-06
Product exploration explored 100000 steps with 13835 reset in 172 ms.
Product exploration explored 100000 steps with 13921 reset in 171 ms.
Computed a total of 20 stabilizing places and 27 stable transitions
Computed a total of 20 stabilizing places and 27 stable transitions
Detected a total of 20/27 stabilizing places and 27/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 779 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), false, false, false, false]
RANDOM walk for 40003 steps (1130 resets) in 301 ms. (132 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40003 steps (242 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (223 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (224 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
[2024-05-22 06:57:44] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-22 06:57:44] [INFO ] Invariant cache hit.
[2024-05-22 06:57:44] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/22 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 6 (OVERLAPS) 18/40 variables, 8/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 9/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/54 variables, 5/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 5/37 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/59 variables, 4/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/59 variables, 1/42 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/59 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/62 variables, 1/43 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/62 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/62 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/63 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/63 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/63 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/64 variables, and 45 constraints, problems are : Problem set: 2 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/22 variables, 8/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 8/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 40/64 variables, and 27 constraints, problems are : Problem set: 3 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/27 constraints, ReadFeed: 10/17 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p1 (NOT p0))), (G (OR (NOT p2) p1 (NOT p0))), (G (OR p2 p1 p0))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (NOT (OR (NOT p2) (NOT p1) (NOT p0)))), (F (NOT (AND p2 p1 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1) p0))), (F (NOT (OR p2 (NOT p1) (NOT p0)))), (F (NOT p1)), (F (NOT (OR (NOT p2) p1 p0))), (F p0)]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 187 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-06 finished in 2862 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-06 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-22 06:57:45] [INFO ] Flatten gal took : 16 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 96905 ms.
ITS solved all properties within timeout

BK_STOP 1716361065238

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-07b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DiscoveryGPU-PT-07b, 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 r135-tall-171631131000387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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