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.r496-tall-171640603500459.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is GPPP-PT-C1000N0000001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603500459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C1000N0000001000-LTLCardinality-00
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-01
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-02
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-03
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-04
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-05
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-06
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-07
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-08
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-09
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-10
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-11
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-12
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-13
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-14
FORMULA_NAME GPPP-PT-C1000N0000001000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717197480202

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C1000N0000001000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:18:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:18:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:18:01] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-05-31 23:18:01] [INFO ] Transformed 33 places.
[2024-05-31 23:18:01] [INFO ] Transformed 22 transitions.
[2024-05-31 23:18:01] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 11 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-31 23:18:01] [INFO ] Invariants computation overflowed in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 1 (OVERLAPS) 22/54 variables, 32/32 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/33 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 33 constraints, problems are : Problem set: 1 solved, 20 unsolved in 417 ms.
Refiners :[State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 22/53 variables, 31/31 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 16/47 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 2/55 variables, 2/49 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 4/53 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 53 constraints, problems are : Problem set: 1 solved, 20 unsolved in 651 ms.
Refiners :[State Equation: 33/33 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 1131ms problems are : Problem set: 1 solved, 20 unsolved
Search for dead transitions found 1 dead transitions in 1145ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
// Phase 1: matrix 21 rows 33 cols
[2024-05-31 23:18:02] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-31 23:18:02] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 21 rows 33 cols
[2024-05-31 23:18:02] [INFO ] Invariants computation overflowed in 5 ms
[2024-05-31 23:18:02] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 21/22 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Applied a total of 1 rules in 6 ms. Remains 31 /32 variables (removed 1) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:18:03] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-31 23:18:03] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:18:03] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:18:03] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 31/33 places, 21/22 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1432 ms. Remains : 31/33 places, 21/22 transitions.
Support contains 23 out of 31 places after structural reductions.
[2024-05-31 23:18:03] [INFO ] Flatten gal took : 17 ms
[2024-05-31 23:18:03] [INFO ] Flatten gal took : 6 ms
[2024-05-31 23:18:03] [INFO ] Input system was already deterministic with 21 transitions.
RANDOM walk for 48032 steps (8 resets) in 205 ms. (233 steps per ms) remains 21/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 7/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 6/6 properties
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:18:03] [INFO ] Invariants computation overflowed in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 17/29 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 23/52 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 31 constraints, problems are : Problem set: 0 solved, 6 unsolved in 89 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
[2024-05-31 23:18:03] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 5 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 17/29 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 4 (OVERLAPS) 23/52 variables, 19/32 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/36 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 36 constraints, problems are : Problem set: 2 solved, 4 unsolved in 169 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 267ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 20026 steps, including 0 resets, run visited all 4 properties in 267 ms. (steps per millisecond=75 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 271 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 29 stabilizing places and 19 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:18:04] [INFO ] Invariants computation overflowed in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 197 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/52 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 472 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 676ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 677ms
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:18:05] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:18:05] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:18:05] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:18:05] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 759 ms. Remains : 30/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-00
Product exploration explored 100000 steps with 10 reset in 216 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-00 finished in 1278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (trivial) has 5 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 28 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 28 transition count 17
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 5 place count 27 transition count 17
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 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 23 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 21 transition count 13
Applied a total of 15 rules in 16 ms. Remains 21 /31 variables (removed 10) and now considering 13/21 (removed 8) transitions.
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 21 cols
[2024-05-31 23:18:05] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 23:18:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 12/33 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 31 constraints, problems are : Problem set: 0 solved, 12 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 21/34 variables, and 9 constraints, problems are : Problem set: 0 solved, 12 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/21 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 20157ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 20158ms
[2024-05-31 23:18:25] [INFO ] Invariant cache hit.
[2024-05-31 23:18:25] [INFO ] Implicit Places using invariants in 41 ms returned [0, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/31 places, 13/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20218 ms. Remains : 19/31 places, 13/21 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-03
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-03 finished in 20364 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)) U G(p1)))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (trivial) has 5 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 28 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 28 transition count 17
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 5 place count 27 transition count 17
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 2 with 4 rules applied. Total rules applied 9 place count 25 transition count 15
Applied a total of 9 rules in 11 ms. Remains 25 /31 variables (removed 6) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 25 cols
[2024-05-31 23:18:26] [INFO ] Computed 11 invariants in 0 ms
[2024-05-31 23:18:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/39 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/40 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 37 constraints, problems are : Problem set: 0 solved, 14 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 25/40 variables, and 11 constraints, problems are : Problem set: 0 solved, 14 unsolved in 20008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/25 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 20197ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 20198ms
[2024-05-31 23:18:46] [INFO ] Invariant cache hit.
[2024-05-31 23:18:46] [INFO ] Implicit Places using invariants in 42 ms returned [0, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/31 places, 15/21 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 13
Applied a total of 5 rules in 2 ms. Remains 20 /23 variables (removed 3) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 20 cols
[2024-05-31 23:18:46] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:18:46] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 13 rows 20 cols
[2024-05-31 23:18:46] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:18:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:18:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/31 places, 13/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20336 ms. Remains : 20/31 places, 13/21 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-04
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-04 finished in 20486 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)&&(F(!p1) U G((!p0||X(p2))))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:18:46] [INFO ] Invariants computation overflowed in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 175 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/52 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 469 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 652ms
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:18:47] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:18:47] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:18:47] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:18:47] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 82 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 735 ms. Remains : 29/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2)), true, p1]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-06
Stuttering criterion allowed to conclude after 28105 steps with 0 reset in 55 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-06 finished in 1044 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)) U p1))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (trivial) has 5 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 28 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 28 transition count 17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 26 transition count 16
Applied a total of 7 rules in 8 ms. Remains 26 /31 variables (removed 5) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 26 cols
[2024-05-31 23:18:47] [INFO ] Computed 11 invariants in 0 ms
[2024-05-31 23:18:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 15/41 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/42 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 38 constraints, problems are : Problem set: 0 solved, 15 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 26/42 variables, and 11 constraints, problems are : Problem set: 0 solved, 15 unsolved in 20007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/26 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 20202ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 20202ms
[2024-05-31 23:19:07] [INFO ] Invariant cache hit.
[2024-05-31 23:19:07] [INFO ] Implicit Places using invariants in 44 ms returned [0, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/31 places, 16/21 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 14
Applied a total of 5 rules in 3 ms. Remains 21 /24 variables (removed 3) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 21 cols
[2024-05-31 23:19:07] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:07] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 14 rows 21 cols
[2024-05-31 23:19:07] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:19:07] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/31 places, 14/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20331 ms. Remains : 21/31 places, 14/21 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-07
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-07 finished in 20429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||X(G(p2))))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:19:07] [INFO ] Invariants computation overflowed in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 183 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/52 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 448 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 636ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 637ms
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:19:08] [INFO ] Invariants computation overflowed in 3 ms
[2024-05-31 23:19:08] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:19:08] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:19:08] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 91 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 732 ms. Remains : 29/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 303 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-09 finished in 1058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)||(p2&&X(G(!p0)))))))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:19:09] [INFO ] Invariants computation overflowed in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 157 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/52 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 435 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 600ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 601ms
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:19:09] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:19:09] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:19:09] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-31 23:19:09] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 91 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 695 ms. Remains : 29/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-10
Product exploration explored 100000 steps with 144 reset in 106 ms.
Product exploration explored 100000 steps with 59 reset in 143 ms.
Computed a total of 27 stabilizing places and 19 stable transitions
Graph (complete) has 64 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 27 stabilizing places and 19 stable transitions
Detected a total of 27/29 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 469 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
RANDOM walk for 48032 steps (8 resets) in 34 ms. (1372 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 144 ms. (275 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
// Phase 1: matrix 21 rows 29 cols
[2024-05-31 23:19:11] [INFO ] Invariants computation overflowed in 1 ms
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/39 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/50 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 29 constraints, problems are : Problem set: 0 solved, 4 unsolved in 76 ms.
Refiners :[State Equation: 29/29 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/39 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 6 (OVERLAPS) 11/50 variables, 10/33 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/50 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 33 constraints, problems are : Problem set: 1 solved, 3 unsolved in 97 ms.
Refiners :[State Equation: 29/29 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 1 solved, 3 unsolved
Finished Parikh walk after 1935605 steps, including 91 resets, run visited all 3 properties in 1839 ms. (steps per millisecond=1052 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 1839 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p0)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p2 p1))), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 1418 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 29 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 21/21 transitions.
Graph (trivial) has 2 edges and 29 vertex of which 2 / 29 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 26 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 24 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 22 transition count 16
Applied a total of 9 rules in 6 ms. Remains 22 /29 variables (removed 7) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 22 cols
[2024-05-31 23:19:14] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:19:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/36 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/37 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 15 unsolved in 147 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/36 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/37 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/38 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 38 constraints, problems are : Problem set: 0 solved, 15 unsolved in 289 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 443ms
// Phase 1: matrix 16 rows 22 cols
[2024-05-31 23:19:15] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:15] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2024-05-31 23:19:15] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:19:15] [INFO ] Implicit Places using invariants and state equation in 33 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/29 places, 16/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 513 ms. Remains : 21/29 places, 16/21 transitions.
Computed a total of 21 stabilizing places and 15 stable transitions
Graph (complete) has 47 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 15 stable transitions
Detected a total of 21/21 stabilizing places and 15/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 261 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 48020 steps (8 resets) in 83 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/3 properties
// Phase 1: matrix 16 rows 21 cols
[2024-05-31 23:19:15] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:19:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/29 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/36 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 22 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/29 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/36 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/37 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/37 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 23 constraints, problems are : Problem set: 0 solved, 1 unsolved in 42 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8957 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=497 )
Parikh walk visited 1 properties in 17 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 406 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10 reset in 69 ms.
Product exploration explored 100000 steps with 9 reset in 98 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 21 cols
[2024-05-31 23:19:16] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/35 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/36 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 22 constraints, problems are : Problem set: 0 solved, 15 unsolved in 144 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/35 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 37 constraints, problems are : Problem set: 0 solved, 15 unsolved in 313 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 463ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 463ms
// Phase 1: matrix 16 rows 21 cols
[2024-05-31 23:19:17] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:19:17] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2024-05-31 23:19:17] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:19:17] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-31 23:19:17] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 21 cols
[2024-05-31 23:19:17] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:19:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/35 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/36 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 22 constraints, problems are : Problem set: 0 solved, 15 unsolved in 144 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/35 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 37 constraints, problems are : Problem set: 0 solved, 15 unsolved in 312 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 460ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 460ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 987 ms. Remains : 21/21 places, 16/16 transitions.
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-10 finished in 8887 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))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:19:17] [INFO ] Invariants computation overflowed in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 178 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 21/51 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/52 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 447 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 630ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 630ms
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:19:18] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:18] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 21 rows 31 cols
[2024-05-31 23:19:18] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:19:18] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 68 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 700 ms. Remains : 29/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 5190 steps with 0 reset in 8 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-12 finished in 847 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 (!p0&&(p1 U p2))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (trivial) has 4 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
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 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 29 transition count 19
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 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 10 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 23 transition count 15
Applied a total of 13 rules in 7 ms. Remains 23 /31 variables (removed 8) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 23 cols
[2024-05-31 23:19:18] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/37 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 24 constraints, problems are : Problem set: 0 solved, 14 unsolved in 152 ms.
Refiners :[State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/37 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/38 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 38 constraints, problems are : Problem set: 0 solved, 14 unsolved in 345 ms.
Refiners :[State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 504ms
// Phase 1: matrix 15 rows 23 cols
[2024-05-31 23:19:19] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:19] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2024-05-31 23:19:19] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:19:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:19:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/31 places, 15/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 569 ms. Remains : 22/31 places, 15/21 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p2), (OR (NOT p2) p0)]
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-15
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-15 finished in 674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)||(p2&&X(G(!p0)))))))'
Found a Lengthening insensitive property : GPPP-PT-C1000N0000001000-LTLCardinality-10
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (trivial) has 2 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 24 transition count 16
Applied a total of 9 rules in 9 ms. Remains 24 /31 variables (removed 7) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-05-31 23:19:19] [INFO ] Computed 9 invariants in 0 ms
[2024-05-31 23:19:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 15/39 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/40 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 34 constraints, problems are : Problem set: 0 solved, 15 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 24/40 variables, and 9 constraints, problems are : Problem set: 0 solved, 15 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/24 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 20203ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 20203ms
[2024-05-31 23:19:40] [INFO ] Invariant cache hit.
[2024-05-31 23:19:40] [INFO ] Implicit Places using invariants in 44 ms returned [0, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 22/31 places, 16/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 20259 ms. Remains : 22/31 places, 16/21 transitions.
Running random walk in product with property : GPPP-PT-C1000N0000001000-LTLCardinality-10
Product exploration explored 100000 steps with 63 reset in 83 ms.
Product exploration explored 100000 steps with 80 reset in 85 ms.
Computed a total of 22 stabilizing places and 15 stable transitions
Computed a total of 22 stabilizing places and 15 stable transitions
Detected a total of 22/22 stabilizing places and 15/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 19 factoid took 1375 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p0) p2), false]
RANDOM walk for 48020 steps (8 resets) in 60 ms. (787 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
// Phase 1: matrix 16 rows 22 cols
[2024-05-31 23:19:42] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:42] [INFO ] State equation strengthened by 1 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/37 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/38 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 4 unsolved in 59 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 6 (OVERLAPS) 5/37 variables, 5/26 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/38 variables, 1/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 27 constraints, problems are : Problem set: 1 solved, 3 unsolved in 81 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 24046 steps, including 2 resets, run visited all 3 properties in 159 ms. (steps per millisecond=151 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 159 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p0)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p2 p1))), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 2829 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 22 cols
[2024-05-31 23:19:45] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/36 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/37 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 15 unsolved in 148 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/36 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/37 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/38 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 38 constraints, problems are : Problem set: 0 solved, 15 unsolved in 327 ms.
Refiners :[State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 481ms
// Phase 1: matrix 16 rows 22 cols
[2024-05-31 23:19:46] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:19:46] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2024-05-31 23:19:46] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:19:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 86 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/22 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 572 ms. Remains : 21/22 places, 16/16 transitions.
Computed a total of 21 stabilizing places and 15 stable transitions
Graph (complete) has 47 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 21 stabilizing places and 15 stable transitions
Detected a total of 21/21 stabilizing places and 15/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 277 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 48020 steps (8 resets) in 20 ms. (2286 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/3 properties
// Phase 1: matrix 16 rows 21 cols
[2024-05-31 23:19:46] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/29 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/36 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 22 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/29 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/36 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/37 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/37 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 23 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6045 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=465 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 426 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 9 reset in 62 ms.
Product exploration explored 100000 steps with 10 reset in 74 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 21 cols
[2024-05-31 23:19:47] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/35 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 22 constraints, problems are : Problem set: 0 solved, 15 unsolved in 138 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/35 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 37 constraints, problems are : Problem set: 0 solved, 15 unsolved in 286 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 429ms
// Phase 1: matrix 16 rows 21 cols
[2024-05-31 23:19:48] [INFO ] Invariants computation overflowed in 1 ms
[2024-05-31 23:19:48] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 16 rows 21 cols
[2024-05-31 23:19:48] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:19:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:19:48] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-31 23:19:48] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 21 cols
[2024-05-31 23:19:48] [INFO ] Invariants computation overflowed in 0 ms
[2024-05-31 23:19:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/35 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 22 constraints, problems are : Problem set: 0 solved, 15 unsolved in 150 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 15/35 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 37 constraints, problems are : Problem set: 0 solved, 15 unsolved in 293 ms.
Refiners :[State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 455ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 958 ms. Remains : 21/21 places, 16/16 transitions.
Treatment of property GPPP-PT-C1000N0000001000-LTLCardinality-10 finished in 29156 ms.
[2024-05-31 23:19:48] [INFO ] Flatten gal took : 4 ms
[2024-05-31 23:19:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-31 23:19:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 21 transitions and 77 arcs took 3 ms.
Total runtime 107237 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : GPPP-PT-C1000N0000001000-LTLCardinality-10

BK_STOP 1717197595990

--------------------
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
mcc2024
ltl formula name GPPP-PT-C1000N0000001000-LTLCardinality-10
ltl formula formula --ltl=/tmp/1334/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 31 places, 21 transitions and 77 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1334/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1334/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1334/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1334/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 33 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 32, there are 37 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1341 levels ~10000 states ~10732 transitions
pnml2lts-mc( 1/ 4): ~2673 levels ~20000 states ~21388 transitions
pnml2lts-mc( 1/ 4): ~4003 levels ~40000 states ~66184 transitions
pnml2lts-mc( 2/ 4): ~11378 levels ~80000 states ~191724 transitions
pnml2lts-mc( 2/ 4): ~28068 levels ~160000 states ~335032 transitions
pnml2lts-mc( 2/ 4): ~28068 levels ~320000 states ~654180 transitions
pnml2lts-mc( 2/ 4): ~28068 levels ~640000 states ~1293368 transitions
pnml2lts-mc( 2/ 4): ~28068 levels ~1280000 states ~2572344 transitions
pnml2lts-mc( 2/ 4): ~28068 levels ~2560000 states ~5130944 transitions
pnml2lts-mc( 2/ 4): ~28068 levels ~5120000 states ~10248380 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4553196
pnml2lts-mc( 0/ 4): unique states count: 5054365
pnml2lts-mc( 0/ 4): unique transitions count: 19265090
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 13585434
pnml2lts-mc( 0/ 4): - claim found count: 389991
pnml2lts-mc( 0/ 4): - claim success count: 5067991
pnml2lts-mc( 0/ 4): - cum. max stack depth: 112267
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5067991 states 19289362 transitions, fanout: 3.806
pnml2lts-mc( 0/ 4): Total exploration time 6.860 sec (6.850 sec minimum, 6.855 sec on average)
pnml2lts-mc( 0/ 4): States per second: 738774, Transitions per second: 2811860
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 104.4MB, 20.7 B/state, compr.: 15.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 104.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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