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-171631131000403.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-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131000403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 01:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 01:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 01:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 01:40 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 61K 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-08b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-08b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716363046087

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-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:30:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:30:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:30:47] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-22 07:30:47] [INFO ] Transformed 240 places.
[2024-05-22 07:30:47] [INFO ] Transformed 254 transitions.
[2024-05-22 07:30:47] [INFO ] Found NUPN structural information;
[2024-05-22 07:30:47] [INFO ] Parsed PT model containing 240 places and 254 transitions and 661 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 224 transition count 254
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 55 place count 185 transition count 215
Iterating global reduction 1 with 39 rules applied. Total rules applied 94 place count 185 transition count 215
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 102 place count 177 transition count 207
Iterating global reduction 1 with 8 rules applied. Total rules applied 110 place count 177 transition count 207
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 172 transition count 202
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 172 transition count 202
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 125 place count 167 transition count 197
Iterating global reduction 1 with 5 rules applied. Total rules applied 130 place count 167 transition count 197
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 134 place count 163 transition count 189
Iterating global reduction 1 with 4 rules applied. Total rules applied 138 place count 163 transition count 189
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 142 place count 159 transition count 185
Iterating global reduction 1 with 4 rules applied. Total rules applied 146 place count 159 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 156 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 156 transition count 182
Applied a total of 152 rules in 81 ms. Remains 156 /240 variables (removed 84) and now considering 182/254 (removed 72) transitions.
// Phase 1: matrix 182 rows 156 cols
[2024-05-22 07:30:47] [INFO ] Computed 2 invariants in 15 ms
[2024-05-22 07:30:47] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 07:30:47] [INFO ] Invariant cache hit.
[2024-05-22 07:30:48] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 07:30:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (OVERLAPS) 182/338 variables, 156/158 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 07:30:50] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 15 ms to minimize.
[2024-05-22 07:30:50] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 2 ms to minimize.
[2024-05-22 07:30:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:30:51] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:30:51] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-22 07:30:51] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-05-22 07:30:51] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:30:51] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
[2024-05-22 07:30:51] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2024-05-22 07:30:51] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:30:51] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 11/169 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 0/338 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 169 constraints, problems are : Problem set: 0 solved, 181 unsolved in 6776 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/338 variables, 156/169 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 181/350 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 07:30:56] [INFO ] Deduced a trap composed of 100 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 9627 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 12/12 constraints]
After SMT, in 16515ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16535ms
Starting structural reductions in LTL mode, iteration 1 : 156/240 places, 182/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17024 ms. Remains : 156/240 places, 182/254 transitions.
Support contains 19 out of 156 places after structural reductions.
[2024-05-22 07:31:04] [INFO ] Flatten gal took : 36 ms
[2024-05-22 07:31:04] [INFO ] Flatten gal took : 15 ms
[2024-05-22 07:31:04] [INFO ] Input system was already deterministic with 182 transitions.
RANDOM walk for 19057 steps (70 resets) in 451 ms. (42 steps per ms) remains 0/13 properties
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 307 edges and 156 vertex of which 153 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 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&&F(G(p1))) U (G((p0&&F(G(p1))))||(p0&&X((p2&&F(G(p1))))))))))'
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 182/182 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 150 transition count 175
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 150 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 148 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 148 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 146 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 146 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 145 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 145 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 144 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 144 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 143 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 143 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 142 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 142 transition count 166
Applied a total of 28 rules in 17 ms. Remains 142 /156 variables (removed 14) and now considering 166/182 (removed 16) transitions.
// Phase 1: matrix 166 rows 142 cols
[2024-05-22 07:31:05] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 07:31:05] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 07:31:05] [INFO ] Invariant cache hit.
[2024-05-22 07:31:05] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-22 07:31:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/308 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-22 07:31:07] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 2 ms to minimize.
[2024-05-22 07:31:07] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:31:07] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-05-22 07:31:07] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
[2024-05-22 07:31:07] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:31:07] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 07:31:07] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 07:31:07] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:31:08] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:31:08] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:31:08] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/308 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 155 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5450 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/308 variables, 142/155 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 165/320 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 320 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5808 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 11/11 constraints]
After SMT, in 11312ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 11315ms
Starting structural reductions in LTL mode, iteration 1 : 142/156 places, 166/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11488 ms. Remains : 142/156 places, 166/182 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-08
Product exploration explored 100000 steps with 383 reset in 468 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-08 finished in 12338 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((G(p0)||F(p1)))&&F(((!p2&&X(F((!p2 U (p3||G(!p2))))))||G(F((!p2 U (p3||G(!p2)))))))))'
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 182/182 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 152 transition count 177
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 152 transition count 177
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 150 transition count 175
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 150 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 148 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 148 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 147 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 147 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 146 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 146 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 145 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 145 transition count 169
Applied a total of 22 rules in 23 ms. Remains 145 /156 variables (removed 11) and now considering 169/182 (removed 13) transitions.
// Phase 1: matrix 169 rows 145 cols
[2024-05-22 07:31:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 07:31:17] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 07:31:17] [INFO ] Invariant cache hit.
[2024-05-22 07:31:17] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-22 07:31:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/314 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 4 ms to minimize.
[2024-05-22 07:31:20] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 13/160 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/314 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 160 constraints, problems are : Problem set: 0 solved, 168 unsolved in 5611 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/314 variables, 145/160 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 168/328 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/314 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 328 constraints, problems are : Problem set: 0 solved, 168 unsolved in 5422 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 13/13 constraints]
After SMT, in 11076ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 11079ms
Starting structural reductions in LTL mode, iteration 1 : 145/156 places, 169/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11311 ms. Remains : 145/156 places, 169/182 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p0)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-11
Stuttering criterion allowed to conclude after 292 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-11 finished in 11527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F((G(F(p2))||p1)))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 182/182 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 150 transition count 176
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 150 transition count 176
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 148 transition count 174
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 148 transition count 174
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 146 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 146 transition count 172
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 144 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 144 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 142 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 140 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 140 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 139 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 139 transition count 163
Applied a total of 34 rules in 21 ms. Remains 139 /156 variables (removed 17) and now considering 163/182 (removed 19) transitions.
// Phase 1: matrix 163 rows 139 cols
[2024-05-22 07:31:29] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 07:31:29] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 07:31:29] [INFO ] Invariant cache hit.
[2024-05-22 07:31:29] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-22 07:31:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 163/302 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-22 07:31:31] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:31:31] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:31:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:31:31] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
[2024-05-22 07:31:31] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:31:31] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:31:31] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:31:31] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:31:31] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 9/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/302 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 150 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5279 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/302 variables, 139/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 162/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-22 07:31:36] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 313 constraints, problems are : Problem set: 0 solved, 162 unsolved in 7536 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 10/10 constraints]
After SMT, in 12856ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 12857ms
Starting structural reductions in LTL mode, iteration 1 : 139/156 places, 163/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13109 ms. Remains : 139/156 places, 163/182 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 317 ms.
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 279 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 16 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-12 finished in 13826 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((X(F(p1))||p0))||X(X(X(F(p2)))))))'
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 182/182 transitions.
Graph (complete) has 307 edges and 156 vertex of which 153 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 152 transition count 158
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 132 transition count 158
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 41 place count 132 transition count 132
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 93 place count 106 transition count 132
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 97 place count 102 transition count 127
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 102 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 102 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 101 transition count 126
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 98 transition count 123
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 98 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 97 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 97 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 96 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 96 transition count 120
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 177 place count 64 transition count 88
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 183 place count 58 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 189 place count 58 transition count 76
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 195 place count 52 transition count 70
Iterating global reduction 2 with 6 rules applied. Total rules applied 201 place count 52 transition count 70
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 47 transition count 60
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 47 transition count 60
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 215 place count 43 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 219 place count 43 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 223 place count 39 transition count 48
Iterating global reduction 2 with 4 rules applied. Total rules applied 227 place count 39 transition count 48
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 231 place count 35 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 235 place count 35 transition count 44
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 35 transition count 43
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 35 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 240 place count 33 transition count 41
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 40 edges and 31 vertex of which 28 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 246 place count 28 transition count 35
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 251 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 252 place count 24 transition count 33
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 262 place count 19 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
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 266 place count 17 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 268 place count 17 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 16 transition count 24
Applied a total of 269 rules in 73 ms. Remains 16 /156 variables (removed 140) and now considering 24/182 (removed 158) transitions.
[2024-05-22 07:31:43] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 16 cols
[2024-05-22 07:31:43] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 07:31:43] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 07:31:43] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
[2024-05-22 07:31:43] [INFO ] Invariant cache hit.
[2024-05-22 07:31:43] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-22 07:31:43] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-22 07:31:43] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
[2024-05-22 07:31:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 3/34 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/34 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/35 variables, and 16 constraints, problems are : Problem set: 0 solved, 19 unsolved in 140 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 3/34 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/34 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/35 variables, and 35 constraints, problems are : Problem set: 0 solved, 19 unsolved in 205 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 351ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 354ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/156 places, 24/182 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 490 ms. Remains : 16/156 places, 24/182 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLCardinality-15
Stuttering criterion allowed to conclude after 47 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLCardinality-15 finished in 653 ms.
All properties solved by simple procedures.
Total runtime 56348 ms.
ITS solved all properties within timeout

BK_STOP 1716363103691

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-08b"
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-08b, 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-171631131000403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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