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.r512-smll-171654407200251.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 Peterson-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407200251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 19K Apr 12 02:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 02:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 02:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 42K Apr 12 02:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 262K Apr 12 02:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 12 02:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 224K Apr 12 02:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 100K May 18 16:43 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 Peterson-PT-2-LTLCardinality-00
FORMULA_NAME Peterson-PT-2-LTLCardinality-01
FORMULA_NAME Peterson-PT-2-LTLCardinality-02
FORMULA_NAME Peterson-PT-2-LTLCardinality-03
FORMULA_NAME Peterson-PT-2-LTLCardinality-04
FORMULA_NAME Peterson-PT-2-LTLCardinality-05
FORMULA_NAME Peterson-PT-2-LTLCardinality-06
FORMULA_NAME Peterson-PT-2-LTLCardinality-07
FORMULA_NAME Peterson-PT-2-LTLCardinality-08
FORMULA_NAME Peterson-PT-2-LTLCardinality-09
FORMULA_NAME Peterson-PT-2-LTLCardinality-10
FORMULA_NAME Peterson-PT-2-LTLCardinality-11
FORMULA_NAME Peterson-PT-2-LTLCardinality-12
FORMULA_NAME Peterson-PT-2-LTLCardinality-13
FORMULA_NAME Peterson-PT-2-LTLCardinality-14
FORMULA_NAME Peterson-PT-2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717269315443

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:15:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:15:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:15:17] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-06-01 19:15:17] [INFO ] Transformed 102 places.
[2024-06-01 19:15:17] [INFO ] Transformed 126 transitions.
[2024-06-01 19:15:17] [INFO ] Found NUPN structural information;
[2024-06-01 19:15:17] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-2-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 13 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:15:17] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-06-01 19:15:17] [INFO ] Computed 11 invariants in 9 ms
[2024-06-01 19:15:18] [INFO ] Implicit Places using invariants in 418 ms returned [87, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 467 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 509 ms. Remains : 100/102 places, 126/126 transitions.
Support contains 76 out of 100 places after structural reductions.
[2024-06-01 19:15:18] [INFO ] Flatten gal took : 44 ms
[2024-06-01 19:15:18] [INFO ] Flatten gal took : 30 ms
[2024-06-01 19:15:18] [INFO ] Input system was already deterministic with 126 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (8 resets) in 1815 ms. (22 steps per ms) remains 4/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
[2024-06-01 19:15:19] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2024-06-01 19:15:19] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 19:15:19] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 2 (OVERLAPS) 55/61 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 55/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 19:15:20] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/65 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/66 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 80/142 variables, 62/129 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 12/141 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/152 variables, 6/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 6/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 2/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/168 variables, 4/159 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 4/163 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/168 variables, 10/173 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/168 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 26/194 variables, 1/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/194 variables, 26/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/194 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/195 variables, 1/201 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/195 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/195 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 1/196 variables, 1/203 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/196 variables, 1/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/196 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 24/220 variables, 28/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/220 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/220 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 232 constraints, problems are : Problem set: 1 solved, 2 unsolved in 714 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 56/60 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 56/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/62 variables, 2/65 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 2/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 80/142 variables, 62/129 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 12/141 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 1/142 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 10/152 variables, 6/148 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 6/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 2/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 16/168 variables, 4/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/168 variables, 4/164 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/168 variables, 10/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/168 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 26/194 variables, 1/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/194 variables, 26/201 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 19:15:20] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 3 ms to minimize.
[2024-06-01 19:15:20] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/194 variables, 2/203 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/194 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/195 variables, 1/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/195 variables, 1/205 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/195 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/196 variables, 1/206 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/196 variables, 1/207 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/196 variables, 1/208 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/196 variables, 4/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/196 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 24/220 variables, 28/240 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/220 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/220 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 240 constraints, problems are : Problem set: 1 solved, 2 unsolved in 897 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 1664ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 192 ms.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 100 transition count 95
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 69 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 68 transition count 94
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 64 place count 68 transition count 76
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 100 place count 50 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 46 transition count 72
Applied a total of 108 rules in 33 ms. Remains 46 /100 variables (removed 54) and now considering 72/126 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 46/100 places, 72/126 transitions.
RANDOM walk for 40000 steps (8 resets) in 379 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3754 steps, run visited all 2 properties in 35 ms. (steps per millisecond=107 )
Probabilistic random walk after 3754 steps, saw 973 distinct states, run finished after 41 ms. (steps per millisecond=91 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA Peterson-PT-2-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 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' '!(F(p0))'
Support contains 18 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 124
Reduce places removed 2 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 20 rules applied. Total rules applied 22 place count 98 transition count 106
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 40 place count 80 transition count 106
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 80 transition count 100
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 74 transition count 100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 60 place count 70 transition count 96
Applied a total of 60 rules in 16 ms. Remains 70 /100 variables (removed 30) and now considering 96/126 (removed 30) transitions.
[2024-06-01 19:15:22] [INFO ] Flow matrix only has 90 transitions (discarded 6 similar events)
// Phase 1: matrix 90 rows 70 cols
[2024-06-01 19:15:22] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 19:15:22] [INFO ] Implicit Places using invariants in 81 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/100 places, 96/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 69/100 places, 96/126 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-02
Product exploration explored 100000 steps with 6372 reset in 364 ms.
Stack based approach found an accepted trace after 23 steps with 1 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Peterson-PT-2-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLCardinality-02 finished in 744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 39 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 124
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 8 rules applied. Total rules applied 10 place count 98 transition count 118
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 16 place count 92 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 88 transition count 114
Applied a total of 24 rules in 13 ms. Remains 88 /100 variables (removed 12) and now considering 114/126 (removed 12) transitions.
[2024-06-01 19:15:22] [INFO ] Flow matrix only has 108 transitions (discarded 6 similar events)
// Phase 1: matrix 108 rows 88 cols
[2024-06-01 19:15:22] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 19:15:22] [INFO ] Implicit Places using invariants in 66 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/100 places, 114/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 87/100 places, 114/126 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-03
Product exploration explored 100000 steps with 327 reset in 311 ms.
Stack based approach found an accepted trace after 161 steps with 0 reset with depth 162 and stack size 162 in 1 ms.
FORMULA Peterson-PT-2-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLCardinality-03 finished in 495 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((X(p0)||(p1&&F(!p1)))))'
Support contains 9 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:15:23] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2024-06-01 19:15:23] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 19:15:23] [INFO ] Implicit Places using invariants in 88 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/100 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 99/100 places, 126/126 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-04
Product exploration explored 100000 steps with 33414 reset in 146 ms.
Product exploration explored 100000 steps with 33342 reset in 184 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
RANDOM walk for 163 steps (0 resets) in 4 ms. (32 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:15:24] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2024-06-01 19:15:24] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 19:15:24] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 19:15:24] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:15:24] [INFO ] Invariant cache hit.
[2024-06-01 19:15:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:15:24] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-01 19:15:24] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:15:24] [INFO ] Invariant cache hit.
[2024-06-01 19:15:24] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 2 ms to minimize.
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/126 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:15:27] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:15:28] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/219 variables, 99/227 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 22/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 249 constraints, problems are : Problem set: 0 solved, 123 unsolved in 8051 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 120/219 variables, 99/227 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 22/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 123/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 372 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4776 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 12905ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 12911ms
Finished structural reductions in LTL mode , in 1 iterations and 13129 ms. Remains : 99/99 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
RANDOM walk for 190 steps (0 resets) in 5 ms. (31 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Product exploration explored 100000 steps with 33189 reset in 135 ms.
Product exploration explored 100000 steps with 33191 reset in 151 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 99 transition count 126
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 24 place count 99 transition count 130
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 99 transition count 130
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 54 place count 81 transition count 112
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 72 place count 81 transition count 112
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 81 transition count 112
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 104 place count 67 transition count 98
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 118 place count 67 transition count 98
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 118 rules in 21 ms. Remains 67 /99 variables (removed 32) and now considering 98/126 (removed 28) transitions.
[2024-06-01 19:15:39] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-06-01 19:15:39] [INFO ] Flow matrix only has 92 transitions (discarded 6 similar events)
// Phase 1: matrix 92 rows 67 cols
[2024-06-01 19:15:39] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 19:15:39] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
[2024-06-01 19:15:40] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 16/24 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 92/159 variables, 67/91 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 26/117 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/117 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 0/159 variables, 0/117 constraints. Problems are: Problem set: 26 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 117 constraints, problems are : Problem set: 26 solved, 69 unsolved in 2564 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 26 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 16/21 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/21 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 22/67 variables, 3/24 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 92/159 variables, 67/91 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 26/117 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 69/186 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/186 constraints. Problems are: Problem set: 26 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/159 variables, 0/186 constraints. Problems are: Problem set: 26 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 186 constraints, problems are : Problem set: 26 solved, 69 unsolved in 1849 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 69/95 constraints, Known Traps: 16/16 constraints]
After SMT, in 4443ms problems are : Problem set: 26 solved, 69 unsolved
Search for dead transitions found 26 dead transitions in 4445ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 67/99 places, 72/126 transitions.
Graph (complete) has 192 edges and 67 vertex of which 45 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 45 /67 variables (removed 22) and now considering 72/72 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/99 places, 72/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4484 ms. Remains : 45/99 places, 72/126 transitions.
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Applied a total of 0 rules in 10 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:15:44] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2024-06-01 19:15:44] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 19:15:44] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 19:15:44] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:15:44] [INFO ] Invariant cache hit.
[2024-06-01 19:15:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:15:44] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-01 19:15:44] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:15:44] [INFO ] Invariant cache hit.
[2024-06-01 19:15:44] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:15:44] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:15:44] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 12 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
[2024-06-01 19:15:45] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:15:46] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/126 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:15:46] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:15:47] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/219 variables, 99/227 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 22/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 249 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7578 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 120/219 variables, 99/227 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 22/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 123/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 372 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4741 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints]
After SMT, in 12345ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 12350ms
Finished structural reductions in LTL mode , in 1 iterations and 12597 ms. Remains : 99/99 places, 126/126 transitions.
Treatment of property Peterson-PT-2-LTLCardinality-04 finished in 33611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 27 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:15:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2024-06-01 19:15:56] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 19:15:56] [INFO ] Implicit Places using invariants in 80 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/100 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 99/100 places, 126/126 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-2-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLCardinality-05 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:15:57] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:15:57] [INFO ] Invariant cache hit.
[2024-06-01 19:15:57] [INFO ] Implicit Places using invariants in 76 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/100 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 99/100 places, 126/126 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLCardinality-06 finished in 176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:15:57] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:15:57] [INFO ] Invariant cache hit.
[2024-06-01 19:15:57] [INFO ] Implicit Places using invariants in 83 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/100 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 99/100 places, 126/126 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-2-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-2-LTLCardinality-07 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 100 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 64 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 64 transition count 72
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 46 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 40 transition count 66
Applied a total of 120 rules in 8 ms. Remains 40 /100 variables (removed 60) and now considering 66/126 (removed 60) transitions.
[2024-06-01 19:15:57] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 40 cols
[2024-06-01 19:15:57] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 19:15:57] [INFO ] Implicit Places using invariants in 68 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/100 places, 66/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81 ms. Remains : 39/100 places, 66/126 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-08
Product exploration explored 100000 steps with 24934 reset in 97 ms.
Stack based approach found an accepted trace after 52 steps with 14 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Peterson-PT-2-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLCardinality-08 finished in 224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 100 transition count 91
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 65 transition count 91
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 70 place count 65 transition count 73
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 106 place count 47 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 116 place count 42 transition count 68
Applied a total of 116 rules in 12 ms. Remains 42 /100 variables (removed 58) and now considering 68/126 (removed 58) transitions.
[2024-06-01 19:15:57] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
// Phase 1: matrix 62 rows 42 cols
[2024-06-01 19:15:57] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 19:15:57] [INFO ] Implicit Places using invariants in 68 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/100 places, 68/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 41/100 places, 68/126 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 120 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA Peterson-PT-2-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLCardinality-10 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(!X(p0)) U p1))))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:15:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2024-06-01 19:15:58] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 19:15:58] [INFO ] Implicit Places using invariants in 88 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/100 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 99/100 places, 126/126 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 104 ms.
Product exploration explored 100000 steps with 33333 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-2-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-2-LTLCardinality-11 finished in 547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:15:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:15:58] [INFO ] Invariant cache hit.
[2024-06-01 19:15:58] [INFO ] Implicit Places using invariants in 86 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/100 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 99/100 places, 126/126 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 112 ms.
Product exploration explored 100000 steps with 0 reset in 135 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
[2024-06-01 19:15:59] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2024-06-01 19:15:59] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 19:15:59] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 85/90 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 85/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/93 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 120/213 variables, 93/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 22/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/219 variables, 6/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/219 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 148 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 85/90 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 85/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/93 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 120/213 variables, 93/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 22/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/219 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:15:59] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:15:59] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:15:59] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:16:00] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:16:00] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:16:00] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
[2024-06-01 19:16:00] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Problem apf2 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 7/237 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 19:16:00] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 1/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/219 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 238 constraints, problems are : Problem set: 1 solved, 1 unsolved in 601 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 757ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 99 transition count 94
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 67 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 66 transition count 93
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 66 place count 66 transition count 75
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 102 place count 48 transition count 75
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 112 place count 43 transition count 70
Applied a total of 112 rules in 9 ms. Remains 43 /99 variables (removed 56) and now considering 70/126 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 43/99 places, 70/126 transitions.
RANDOM walk for 40000 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2382 steps, run visited all 1 properties in 11 ms. (steps per millisecond=216 )
Probabilistic random walk after 2382 steps, saw 621 distinct states, run finished after 11 ms. (steps per millisecond=216 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 348 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 83 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 99 transition count 97
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 70 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 68 transition count 95
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 62 place count 68 transition count 79
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 94 place count 52 transition count 79
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 102 place count 48 transition count 75
Applied a total of 102 rules in 8 ms. Remains 48 /99 variables (removed 51) and now considering 75/126 (removed 51) transitions.
[2024-06-01 19:16:00] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
// Phase 1: matrix 69 rows 48 cols
[2024-06-01 19:16:00] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 19:16:00] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 19:16:00] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:00] [INFO ] Invariant cache hit.
[2024-06-01 19:16:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:16:01] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-06-01 19:16:01] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-06-01 19:16:01] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:01] [INFO ] Invariant cache hit.
[2024-06-01 19:16:01] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 69/117 variables, 48/119 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 22/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 141 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2192 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 69/117 variables, 48/119 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 22/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 72/213 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 213 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1449 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 15/15 constraints]
After SMT, in 3670ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3673ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/99 places, 75/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3835 ms. Remains : 48/99 places, 75/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 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 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
[2024-06-01 19:16:04] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:04] [INFO ] Invariant cache hit.
[2024-06-01 19:16:04] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 34/39 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/42 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 69/111 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 22/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/117 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/117 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/117 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 97 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 34/39 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/42 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 69/111 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 22/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/117 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/117 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/117 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:16:05] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
[2024-06-01 19:16:05] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:16:05] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:05] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:05] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:16:05] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
Problem apf2 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/117 variables, 6/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/117 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/117 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 134 constraints, problems are : Problem set: 1 solved, 1 unsolved in 310 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 412ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 75/75 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 1 place count 48 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 47 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 47 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 44 transition count 71
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 10 place count 43 transition count 70
Applied a total of 10 rules in 5 ms. Remains 43 /48 variables (removed 5) and now considering 70/75 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 43/48 places, 70/75 transitions.
RANDOM walk for 40000 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2382 steps, run visited all 1 properties in 9 ms. (steps per millisecond=264 )
Probabilistic random walk after 2382 steps, saw 621 distinct states, run finished after 9 ms. (steps per millisecond=264 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 282 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 79 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 137 ms.
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-06-01 19:16:06] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:06] [INFO ] Invariant cache hit.
[2024-06-01 19:16:06] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 19:16:06] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:06] [INFO ] Invariant cache hit.
[2024-06-01 19:16:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:16:06] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-06-01 19:16:06] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2024-06-01 19:16:06] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:06] [INFO ] Invariant cache hit.
[2024-06-01 19:16:06] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 69/117 variables, 48/119 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 22/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 141 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2149 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 69/117 variables, 48/119 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 22/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 72/213 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 213 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1438 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 15/15 constraints]
After SMT, in 3608ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3609ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3807 ms. Remains : 48/48 places, 75/75 transitions.
Treatment of property Peterson-PT-2-LTLCardinality-12 finished in 11358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 100 transition count 93
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 67 transition count 93
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 66 place count 67 transition count 76
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 100 place count 50 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 45 transition count 71
Applied a total of 110 rules in 9 ms. Remains 45 /100 variables (removed 55) and now considering 71/126 (removed 55) transitions.
[2024-06-01 19:16:10] [INFO ] Flow matrix only has 65 transitions (discarded 6 similar events)
// Phase 1: matrix 65 rows 45 cols
[2024-06-01 19:16:10] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 19:16:10] [INFO ] Implicit Places using invariants in 57 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/100 places, 71/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 71 ms. Remains : 44/100 places, 71/126 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 115 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA Peterson-PT-2-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLCardinality-14 finished in 280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)&&p0)))))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Applied a total of 0 rules in 0 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-06-01 19:16:10] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 100 cols
[2024-06-01 19:16:10] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 19:16:10] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 19:16:10] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:16:10] [INFO ] Invariant cache hit.
[2024-06-01 19:16:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:16:10] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-01 19:16:10] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-06-01 19:16:10] [INFO ] Invariant cache hit.
[2024-06-01 19:16:10] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 1/100 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 19:16:12] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
[2024-06-01 19:16:12] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:16:12] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:16:12] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:16:13] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:16:13] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:16:13] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:16:13] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:16:13] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:16:13] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
[2024-06-01 19:16:13] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 11/126 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/220 variables, 100/226 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 22/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/220 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 248 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7550 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 16/121 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 1/100 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/220 variables, 100/226 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 22/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 123/371 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (OVERLAPS) 0/220 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 371 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4924 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 17/17 constraints]
After SMT, in 12495ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 12498ms
Finished structural reductions in LTL mode , in 1 iterations and 12753 ms. Remains : 100/100 places, 126/126 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-2-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLCardinality-15 finished in 12931 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((X(p0)||(p1&&F(!p1)))))'
Found a Lengthening insensitive property : Peterson-PT-2-LTLCardinality-04
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Support contains 9 out of 100 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 100 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 64 transition count 90
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 72 place count 64 transition count 78
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 96 place count 52 transition count 78
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 46 transition count 72
Applied a total of 108 rules in 5 ms. Remains 46 /100 variables (removed 54) and now considering 72/126 (removed 54) transitions.
[2024-06-01 19:16:23] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
// Phase 1: matrix 66 rows 46 cols
[2024-06-01 19:16:23] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 19:16:23] [INFO ] Implicit Places using invariants in 48 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 45/100 places, 72/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 56 ms. Remains : 45/100 places, 72/126 transitions.
Running random walk in product with property : Peterson-PT-2-LTLCardinality-04
Product exploration explored 100000 steps with 33292 reset in 124 ms.
Product exploration explored 100000 steps with 33341 reset in 139 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
RANDOM walk for 106 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Support contains 9 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 72/72 transitions.
Applied a total of 0 rules in 0 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-06-01 19:16:24] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
// Phase 1: matrix 66 rows 45 cols
[2024-06-01 19:16:24] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 19:16:24] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 19:16:24] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
[2024-06-01 19:16:24] [INFO ] Invariant cache hit.
[2024-06-01 19:16:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:16:24] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-06-01 19:16:24] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
[2024-06-01 19:16:24] [INFO ] Invariant cache hit.
[2024-06-01 19:16:24] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 66/111 variables, 45/113 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 22/135 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 135 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1825 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 66/111 variables, 45/113 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 22/135 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 69/204 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 204 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1325 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 15/15 constraints]
After SMT, in 3166ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 3168ms
Finished structural reductions in LTL mode , in 1 iterations and 3312 ms. Remains : 45/45 places, 72/72 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
RANDOM walk for 107 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 253 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Product exploration explored 100000 steps with 33277 reset in 125 ms.
Product exploration explored 100000 steps with 33258 reset in 142 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Support contains 9 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-06-01 19:16:29] [INFO ] Redundant transitions in 2 ms returned []
Running 69 sub problems to find dead transitions.
[2024-06-01 19:16:29] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
[2024-06-01 19:16:29] [INFO ] Invariant cache hit.
[2024-06-01 19:16:29] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 66/111 variables, 45/113 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 22/135 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 135 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1804 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 66/111 variables, 45/113 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 22/135 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 69/204 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 204 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1321 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 15/15 constraints]
After SMT, in 3138ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 3139ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3148 ms. Remains : 45/45 places, 72/72 transitions.
Support contains 9 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-06-01 19:16:32] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
[2024-06-01 19:16:32] [INFO ] Invariant cache hit.
[2024-06-01 19:16:32] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 19:16:32] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
[2024-06-01 19:16:32] [INFO ] Invariant cache hit.
[2024-06-01 19:16:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:16:32] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-06-01 19:16:32] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
[2024-06-01 19:16:32] [INFO ] Invariant cache hit.
[2024-06-01 19:16:32] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 66/111 variables, 45/113 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 22/135 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 135 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1902 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 66/111 variables, 45/113 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 22/135 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 69/204 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 204 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1363 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 15/15 constraints]
After SMT, in 3279ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 3281ms
Finished structural reductions in LTL mode , in 1 iterations and 3432 ms. Remains : 45/45 places, 72/72 transitions.
Treatment of property Peterson-PT-2-LTLCardinality-04 finished in 12877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Found a Lengthening insensitive property : Peterson-PT-2-LTLCardinality-12
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 100/100 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 100 transition count 97
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 71 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 69 transition count 95
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 62 place count 69 transition count 79
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 94 place count 53 transition count 79
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 102 place count 49 transition count 75
Applied a total of 102 rules in 6 ms. Remains 49 /100 variables (removed 51) and now considering 75/126 (removed 51) transitions.
[2024-06-01 19:16:36] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
// Phase 1: matrix 69 rows 49 cols
[2024-06-01 19:16:36] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 19:16:36] [INFO ] Implicit Places using invariants in 64 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 48/100 places, 75/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 73 ms. Remains : 48/100 places, 75/126 transitions.
Running random walk in product with property : Peterson-PT-2-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 120 ms.
Product exploration explored 100000 steps with 0 reset in 129 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
[2024-06-01 19:16:36] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
// Phase 1: matrix 69 rows 48 cols
[2024-06-01 19:16:36] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 19:16:36] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 34/39 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/42 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 69/111 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 22/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/117 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/117 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/117 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 105 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 34/39 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/42 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 69/111 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 22/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/117 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/117 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/117 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Problem apf2 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/117 variables, 6/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/117 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/117 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 134 constraints, problems are : Problem set: 1 solved, 1 unsolved in 304 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 416ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 75/75 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 1 place count 48 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 47 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 47 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 44 transition count 71
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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 43 transition count 70
Applied a total of 10 rules in 7 ms. Remains 43 /48 variables (removed 5) and now considering 70/75 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 43/48 places, 70/75 transitions.
RANDOM walk for 40000 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2382 steps, run visited all 1 properties in 8 ms. (steps per millisecond=297 )
Probabilistic random walk after 2382 steps, saw 621 distinct states, run finished after 8 ms. (steps per millisecond=297 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 208 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 79 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 75/75 transitions.
Applied a total of 0 rules in 8 ms. Remains 48 /48 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-06-01 19:16:37] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:37] [INFO ] Invariant cache hit.
[2024-06-01 19:16:37] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 19:16:37] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:37] [INFO ] Invariant cache hit.
[2024-06-01 19:16:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:16:37] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-01 19:16:37] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-06-01 19:16:37] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:37] [INFO ] Invariant cache hit.
[2024-06-01 19:16:37] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 69/117 variables, 48/119 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 22/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 141 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2241 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 69/117 variables, 48/119 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 22/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 72/213 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 213 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1410 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 15/15 constraints]
After SMT, in 3666ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3668ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3848 ms. Remains : 48/48 places, 75/75 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 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 80 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
[2024-06-01 19:16:41] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:41] [INFO ] Invariant cache hit.
[2024-06-01 19:16:41] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 34/39 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/42 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 69/111 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 22/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/117 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/117 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/117 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 109 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 34/39 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/42 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 69/111 variables, 42/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 22/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/117 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/117 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/117 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
Problem apf2 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/117 variables, 6/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/117 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/117 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 134 constraints, problems are : Problem set: 1 solved, 1 unsolved in 305 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 420ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 75/75 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 1 place count 48 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 47 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 47 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 44 transition count 71
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 10 place count 43 transition count 70
Applied a total of 10 rules in 10 ms. Remains 43 /48 variables (removed 5) and now considering 70/75 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 43/48 places, 70/75 transitions.
RANDOM walk for 40000 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2382 steps, run visited all 1 properties in 7 ms. (steps per millisecond=340 )
Probabilistic random walk after 2382 steps, saw 621 distinct states, run finished after 8 ms. (steps per millisecond=297 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 205 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 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 119 ms.
Product exploration explored 100000 steps with 0 reset in 129 ms.
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-06-01 19:16:43] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:43] [INFO ] Invariant cache hit.
[2024-06-01 19:16:43] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 19:16:43] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:43] [INFO ] Invariant cache hit.
[2024-06-01 19:16:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 19:16:43] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-01 19:16:43] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-06-01 19:16:43] [INFO ] Flow matrix only has 69 transitions (discarded 6 similar events)
[2024-06-01 19:16:43] [INFO ] Invariant cache hit.
[2024-06-01 19:16:43] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:16:43] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 19:16:44] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 69/117 variables, 48/119 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 22/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 141 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2167 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 69/117 variables, 48/119 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 22/141 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 72/213 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 213 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1453 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 15/15 constraints]
After SMT, in 3633ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3635ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3811 ms. Remains : 48/48 places, 75/75 transitions.
Treatment of property Peterson-PT-2-LTLCardinality-12 finished in 10740 ms.
[2024-06-01 19:16:46] [INFO ] Flatten gal took : 12 ms
[2024-06-01 19:16:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 19:16:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 126 transitions and 380 arcs took 7 ms.
Total runtime 89748 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Peterson-PT-2-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-2-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717269407507

--------------------
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 Peterson-PT-2-LTLCardinality-04
ltl formula formula --ltl=/tmp/2193/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 100 places, 126 transitions and 380 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.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2193/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2193/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2193/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2193/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 102 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 101, there are 133 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( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~27!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 95
pnml2lts-mc( 0/ 4): unique states count: 199
pnml2lts-mc( 0/ 4): unique transitions count: 597
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6
pnml2lts-mc( 0/ 4): - claim found count: 7
pnml2lts-mc( 0/ 4): - claim success count: 206
pnml2lts-mc( 0/ 4): - cum. max stack depth: 110
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 206 states 637 transitions, fanout: 3.092
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20600, Transitions per second: 63700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 19.0 B/state, compr.: 4.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Peterson-PT-2-LTLCardinality-12
ltl formula formula --ltl=/tmp/2193/ltl_1_
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 100 places, 126 transitions and 380 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.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2193/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2193/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2193/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2193/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 102 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 101, there are 184 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( 2/ 4): ~416 levels ~10000 states ~31108 transitions
pnml2lts-mc( 3/ 4): ~348 levels ~20000 states ~60832 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~135!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3654
pnml2lts-mc( 0/ 4): unique states count: 24267
pnml2lts-mc( 0/ 4): unique transitions count: 75282
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 33882
pnml2lts-mc( 0/ 4): - claim found count: 18264
pnml2lts-mc( 0/ 4): - claim success count: 25546
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1549
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26085 states 80836 transitions, fanout: 3.099
pnml2lts-mc( 0/ 4): Total exploration time 0.230 sec (0.230 sec minimum, 0.230 sec on average)
pnml2lts-mc( 0/ 4): States per second: 113413, Transitions per second: 351461
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 12.0 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~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="Peterson-PT-2"
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 Peterson-PT-2, 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 r512-smll-171654407200251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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