About the Execution of ITS-Tools for Anderson-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 411.668 | 217875.00 | 253948.00 | 1250.60 | TFFFFFFTFFFFFFTF | normal |
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.r004-smll-171620118300315.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Anderson-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118300315
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 15:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 15:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-04-LTLCardinality-00
FORMULA_NAME Anderson-PT-04-LTLCardinality-01
FORMULA_NAME Anderson-PT-04-LTLCardinality-02
FORMULA_NAME Anderson-PT-04-LTLCardinality-03
FORMULA_NAME Anderson-PT-04-LTLCardinality-04
FORMULA_NAME Anderson-PT-04-LTLCardinality-05
FORMULA_NAME Anderson-PT-04-LTLCardinality-06
FORMULA_NAME Anderson-PT-04-LTLCardinality-07
FORMULA_NAME Anderson-PT-04-LTLCardinality-08
FORMULA_NAME Anderson-PT-04-LTLCardinality-09
FORMULA_NAME Anderson-PT-04-LTLCardinality-10
FORMULA_NAME Anderson-PT-04-LTLCardinality-11
FORMULA_NAME Anderson-PT-04-LTLCardinality-12
FORMULA_NAME Anderson-PT-04-LTLCardinality-13
FORMULA_NAME Anderson-PT-04-LTLCardinality-14
FORMULA_NAME Anderson-PT-04-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716422683996
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-23 00:04:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 00:04:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:04:46] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-05-23 00:04:46] [INFO ] Transformed 105 places.
[2024-05-23 00:04:46] [INFO ] Transformed 200 transitions.
[2024-05-23 00:04:46] [INFO ] Found NUPN structural information;
[2024-05-23 00:04:46] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 200/200 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 89 transition count 136
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 89 transition count 136
Applied a total of 32 rules in 164 ms. Remains 89 /105 variables (removed 16) and now considering 136/200 (removed 64) transitions.
// Phase 1: matrix 136 rows 89 cols
[2024-05-23 00:04:47] [INFO ] Computed 11 invariants in 17 ms
[2024-05-23 00:04:47] [INFO ] Implicit Places using invariants in 427 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 486 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/105 places, 136/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 690 ms. Remains : 88/105 places, 136/200 transitions.
Support contains 24 out of 88 places after structural reductions.
[2024-05-23 00:04:48] [INFO ] Flatten gal took : 69 ms
[2024-05-23 00:04:48] [INFO ] Flatten gal took : 30 ms
[2024-05-23 00:04:48] [INFO ] Input system was already deterministic with 136 transitions.
RANDOM walk for 5078 steps (0 resets) in 479 ms. (10 steps per ms) remains 0/16 properties
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' '!(G(F((G((G((p1&&F(p2))) U p2))||p0))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 88 transition count 122
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 74 transition count 122
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 28 place count 74 transition count 112
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 64 transition count 112
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 56 place count 56 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 56 transition count 80
Applied a total of 64 rules in 51 ms. Remains 56 /88 variables (removed 32) and now considering 80/136 (removed 56) transitions.
// Phase 1: matrix 80 rows 56 cols
[2024-05-23 00:04:48] [INFO ] Computed 10 invariants in 5 ms
[2024-05-23 00:04:49] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-23 00:04:49] [INFO ] Invariant cache hit.
[2024-05-23 00:04:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:04:49] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-05-23 00:04:49] [INFO ] Redundant transitions in 3 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-23 00:04:49] [INFO ] Invariant cache hit.
[2024-05-23 00:04:49] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-23 00:04:50] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 11 ms to minimize.
[2024-05-23 00:04:50] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:04:50] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-23 00:04:50] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-23 00:04:51] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 80/136 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 76 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 83 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3156 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 56/56 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 1/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-23 00:04:53] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-23 00:04:53] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 80/136 variables, 56/73 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 76/161 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/136 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-23 00:04:55] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/136 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 15 (OVERLAPS) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 162 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5625 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 56/56 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 8/8 constraints]
After SMT, in 8926ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 8943ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/88 places, 80/136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9481 ms. Remains : 56/88 places, 80/136 transitions.
Stuttering acceptance computed with spot in 555 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-00
Product exploration explored 100000 steps with 659 reset in 624 ms.
Product exploration explored 100000 steps with 739 reset in 251 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 p0 p2 p1), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X p2), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X p1), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 148 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 309 ms. (129 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
[2024-05-23 00:05:00] [INFO ] Invariant cache hit.
[2024-05-23 00:05:00] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 51/136 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/56 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 36ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X p2), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X p1), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1)))))]
Knowledge based reduction with 19 factoid took 477 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 80/80 transitions.
Applied a total of 0 rules in 7 ms. Remains 56 /56 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-23 00:05:01] [INFO ] Invariant cache hit.
[2024-05-23 00:05:01] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-23 00:05:01] [INFO ] Invariant cache hit.
[2024-05-23 00:05:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:05:01] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-23 00:05:01] [INFO ] Redundant transitions in 2 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-23 00:05:01] [INFO ] Invariant cache hit.
[2024-05-23 00:05:01] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-23 00:05:02] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-23 00:05:02] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:05:02] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-23 00:05:02] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-23 00:05:03] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 80/136 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 76 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 83 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3322 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 56/56 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 1/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-23 00:05:06] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-23 00:05:06] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 80/136 variables, 56/73 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 76/161 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/136 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-23 00:05:09] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/136 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 15 (OVERLAPS) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 162 constraints, problems are : Problem set: 0 solved, 76 unsolved in 7042 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 56/56 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 8/8 constraints]
After SMT, in 10441ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 10444ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10828 ms. Remains : 56/56 places, 80/80 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 p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 197 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
[2024-05-23 00:05:12] [INFO ] Invariant cache hit.
[2024-05-23 00:05:12] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 51/136 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/56 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X p0)), (X (X p1)), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1)))))]
Knowledge based reduction with 19 factoid took 580 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 678 reset in 209 ms.
Product exploration explored 100000 steps with 729 reset in 242 ms.
Built C files in :
/tmp/ltsmin8102301664616367281
[2024-05-23 00:05:14] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2024-05-23 00:05:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:05:14] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2024-05-23 00:05:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:05:14] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2024-05-23 00:05:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:05:14] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8102301664616367281
Running compilation step : cd /tmp/ltsmin8102301664616367281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 800 ms.
Running link step : cd /tmp/ltsmin8102301664616367281;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin8102301664616367281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10113163858774400606.hoa' '--buchi-type=spotba'
LTSmin run took 329 ms.
FORMULA Anderson-PT-04-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-04-LTLCardinality-00 finished in 27327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 81 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 81 transition count 111
Applied a total of 14 rules in 12 ms. Remains 81 /88 variables (removed 7) and now considering 111/136 (removed 25) transitions.
// Phase 1: matrix 111 rows 81 cols
[2024-05-23 00:05:16] [INFO ] Computed 10 invariants in 4 ms
[2024-05-23 00:05:16] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-23 00:05:16] [INFO ] Invariant cache hit.
[2024-05-23 00:05:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:05:16] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-23 00:05:16] [INFO ] Invariant cache hit.
[2024-05-23 00:05:16] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-23 00:05:17] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:05:17] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:05:17] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:05:17] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:05:17] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:05:17] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:05:18] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:05:18] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 3 ms to minimize.
[2024-05-23 00:05:18] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:05:18] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-23 00:05:18] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:05:18] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:05:18] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:05:19] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:05:19] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:05:19] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-23 00:05:19] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:05:19] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-23 00:05:20] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 5 ms to minimize.
[2024-05-23 00:05:20] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 111/192 variables, 81/111 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 123 constraints, problems are : Problem set: 0 solved, 107 unsolved in 9321 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-23 00:05:26] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 111/192 variables, 81/112 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 107/231 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-23 00:05:34] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 2 ms to minimize.
[2024-05-23 00:05:35] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-23 00:05:38] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
[2024-05-23 00:05:38] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 235 constraints, problems are : Problem set: 0 solved, 107 unsolved in 20433 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 25/25 constraints]
After SMT, in 29821ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 29824ms
Starting structural reductions in LTL mode, iteration 1 : 81/88 places, 111/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30242 ms. Remains : 81/88 places, 111/136 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLCardinality-02 finished in 30348 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((X((p1||F(p2)))&&p0)))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 83 transition count 113
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 83 transition count 113
Applied a total of 10 rules in 7 ms. Remains 83 /88 variables (removed 5) and now considering 113/136 (removed 23) transitions.
// Phase 1: matrix 113 rows 83 cols
[2024-05-23 00:05:46] [INFO ] Computed 10 invariants in 10 ms
[2024-05-23 00:05:46] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-23 00:05:46] [INFO ] Invariant cache hit.
[2024-05-23 00:05:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:05:46] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-23 00:05:46] [INFO ] Invariant cache hit.
[2024-05-23 00:05:46] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-23 00:05:47] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:05:47] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:05:47] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:05:47] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:05:47] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:05:48] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:05:48] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:05:48] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:05:48] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 2 ms to minimize.
[2024-05-23 00:05:48] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 3 ms to minimize.
[2024-05-23 00:05:48] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:05:48] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-23 00:05:49] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:05:49] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:05:49] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:05:49] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 6 ms to minimize.
[2024-05-23 00:05:49] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:05:49] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:05:49] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-23 00:05:50] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:05:50] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:05:50] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-05-23 00:05:50] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 113/196 variables, 83/116 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 12/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 128 constraints, problems are : Problem set: 0 solved, 109 unsolved in 8572 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-23 00:05:55] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-23 00:05:55] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-23 00:05:56] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 2 ms to minimize.
[2024-05-23 00:05:56] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-23 00:05:57] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:05:58] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-05-23 00:05:58] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-23 00:05:59] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-05-23 00:05:59] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-23 00:06:02] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-23 00:06:03] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-23 00:06:04] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:06:04] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 113/196 variables, 83/129 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 109/250 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (OVERLAPS) 0/196 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 250 constraints, problems are : Problem set: 0 solved, 109 unsolved in 23899 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 36/36 constraints]
After SMT, in 32514ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 32517ms
Starting structural reductions in LTL mode, iteration 1 : 83/88 places, 113/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32780 ms. Remains : 83/88 places, 113/136 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-04
Product exploration explored 100000 steps with 286 reset in 172 ms.
Stack based approach found an accepted trace after 35 steps with 1 reset with depth 31 and stack size 31 in 1 ms.
FORMULA Anderson-PT-04-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-04 finished in 33168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 88 transition count 121
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 73 transition count 121
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 30 place count 73 transition count 109
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 54 place count 61 transition count 109
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 62 place count 53 transition count 77
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 53 transition count 77
Applied a total of 70 rules in 29 ms. Remains 53 /88 variables (removed 35) and now considering 77/136 (removed 59) transitions.
// Phase 1: matrix 77 rows 53 cols
[2024-05-23 00:06:19] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 00:06:19] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-23 00:06:19] [INFO ] Invariant cache hit.
[2024-05-23 00:06:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:06:19] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-23 00:06:19] [INFO ] Redundant transitions in 2 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-23 00:06:19] [INFO ] Invariant cache hit.
[2024-05-23 00:06:20] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-23 00:06:20] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-23 00:06:20] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 1/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-23 00:06:21] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:06:21] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:06:21] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 77/130 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 80 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3616 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-23 00:06:24] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-23 00:06:24] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-23 00:06:24] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-23 00:06:24] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-23 00:06:24] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-23 00:06:24] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-05-23 00:06:24] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-23 00:06:24] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:06:24] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/53 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-23 00:06:26] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-23 00:06:26] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-23 00:06:26] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 77/130 variables, 53/80 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 73/165 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/130 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 15 (OVERLAPS) 0/130 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 165 constraints, problems are : Problem set: 0 solved, 73 unsolved in 7514 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 17/17 constraints]
After SMT, in 11174ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 11177ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/88 places, 77/136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11545 ms. Remains : 53/88 places, 77/136 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-05
Product exploration explored 100000 steps with 742 reset in 100 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA Anderson-PT-04-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-05 finished in 11732 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(p2)||F(p3)||p1))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 88 transition count 121
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 73 transition count 121
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 73 transition count 111
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 63 transition count 111
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 57 transition count 87
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 57 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 56 transition count 86
Applied a total of 64 rules in 14 ms. Remains 56 /88 variables (removed 32) and now considering 86/136 (removed 50) transitions.
// Phase 1: matrix 86 rows 56 cols
[2024-05-23 00:06:31] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 00:06:31] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-23 00:06:31] [INFO ] Invariant cache hit.
[2024-05-23 00:06:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:06:31] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-23 00:06:31] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-23 00:06:31] [INFO ] Invariant cache hit.
[2024-05-23 00:06:31] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-23 00:06:32] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-23 00:06:32] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-23 00:06:32] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-23 00:06:32] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-23 00:06:32] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-23 00:06:32] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 4 ms to minimize.
[2024-05-23 00:06:33] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-23 00:06:33] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 86/142 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 86 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3683 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-23 00:06:35] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 86/142 variables, 56/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 82/169 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-23 00:06:37] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-23 00:06:38] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-23 00:06:38] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-05-23 00:06:38] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-23 00:06:38] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-23 00:06:39] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-23 00:06:39] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 176 constraints, problems are : Problem set: 0 solved, 82 unsolved in 8316 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 16/16 constraints]
After SMT, in 12047ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 12049ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/88 places, 86/136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12394 ms. Remains : 56/88 places, 86/136 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-08
Product exploration explored 100000 steps with 768 reset in 142 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA Anderson-PT-04-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-08 finished in 12681 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(F(p0))||(F(p0)&&G(!p1)))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 88 transition count 124
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 76 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 74 transition count 122
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 28 place count 74 transition count 110
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 52 place count 62 transition count 110
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 59 place count 55 transition count 85
Iterating global reduction 3 with 7 rules applied. Total rules applied 66 place count 55 transition count 85
Applied a total of 66 rules in 19 ms. Remains 55 /88 variables (removed 33) and now considering 85/136 (removed 51) transitions.
// Phase 1: matrix 85 rows 55 cols
[2024-05-23 00:06:44] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 00:06:44] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-23 00:06:44] [INFO ] Invariant cache hit.
[2024-05-23 00:06:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:06:44] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-05-23 00:06:44] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-23 00:06:44] [INFO ] Invariant cache hit.
[2024-05-23 00:06:44] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:06:44] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-23 00:06:44] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-23 00:06:44] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-23 00:06:44] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-23 00:06:44] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:06:45] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-23 00:06:45] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:06:45] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-23 00:06:45] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-23 00:06:45] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-23 00:06:45] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-23 00:06:45] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
[2024-05-23 00:06:45] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-23 00:06:45] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 85/140 variables, 55/79 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 81 unsolved in 4452 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 55/55 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:06:49] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-23 00:06:49] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-23 00:06:49] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-23 00:06:49] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:06:49] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-23 00:06:49] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-23 00:06:49] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:06:50] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:06:51] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 85/140 variables, 55/88 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 81/181 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 181 constraints, problems are : Problem set: 0 solved, 81 unsolved in 7721 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 55/55 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 23/23 constraints]
After SMT, in 12210ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 12211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/88 places, 85/136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12476 ms. Remains : 55/88 places, 85/136 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-09
Product exploration explored 100000 steps with 675 reset in 115 ms.
Product exploration explored 100000 steps with 672 reset in 144 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 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 126 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
RANDOM walk for 394 steps (0 resets) in 20 ms. (18 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 85/85 transitions.
Applied a total of 0 rules in 5 ms. Remains 55 /55 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-23 00:06:57] [INFO ] Invariant cache hit.
[2024-05-23 00:06:57] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-23 00:06:57] [INFO ] Invariant cache hit.
[2024-05-23 00:06:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:06:58] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-23 00:06:58] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-23 00:06:58] [INFO ] Invariant cache hit.
[2024-05-23 00:06:58] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:06:58] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-23 00:06:58] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:06:58] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-23 00:06:58] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:06:59] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:06:59] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:06:59] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:06:59] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-23 00:07:00] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:07:00] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-23 00:07:00] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:07:00] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-23 00:07:00] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:07:00] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 85/140 variables, 55/79 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5370 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 55/55 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:07:03] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-05-23 00:07:04] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-23 00:07:04] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-23 00:07:04] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:07:04] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-23 00:07:04] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:07:04] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:07:05] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-23 00:07:06] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 85/140 variables, 55/88 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 81/181 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 181 constraints, problems are : Problem set: 0 solved, 81 unsolved in 9115 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 55/55 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 23/23 constraints]
After SMT, in 14531ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 14534ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14869 ms. Remains : 55/55 places, 85/85 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 p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
RANDOM walk for 263 steps (0 resets) in 9 ms. (26 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 375 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 712 reset in 267 ms.
Product exploration explored 100000 steps with 665 reset in 334 ms.
Built C files in :
/tmp/ltsmin7479197584509685231
[2024-05-23 00:07:14] [INFO ] Computing symmetric may disable matrix : 85 transitions.
[2024-05-23 00:07:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:07:14] [INFO ] Computing symmetric may enable matrix : 85 transitions.
[2024-05-23 00:07:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:07:14] [INFO ] Computing Do-Not-Accords matrix : 85 transitions.
[2024-05-23 00:07:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:07:14] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7479197584509685231
Running compilation step : cd /tmp/ltsmin7479197584509685231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 369 ms.
Running link step : cd /tmp/ltsmin7479197584509685231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7479197584509685231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased942708846263528216.hoa' '--buchi-type=spotba'
LTSmin run took 247 ms.
FORMULA Anderson-PT-04-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-04-LTLCardinality-09 finished in 30930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 81 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 81 transition count 105
Applied a total of 14 rules in 10 ms. Remains 81 /88 variables (removed 7) and now considering 105/136 (removed 31) transitions.
// Phase 1: matrix 105 rows 81 cols
[2024-05-23 00:07:14] [INFO ] Computed 10 invariants in 2 ms
[2024-05-23 00:07:15] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-23 00:07:15] [INFO ] Invariant cache hit.
[2024-05-23 00:07:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:07:15] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-23 00:07:15] [INFO ] Invariant cache hit.
[2024-05-23 00:07:15] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:16] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
[2024-05-23 00:07:16] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:07:16] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:07:16] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:16] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:17] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:18] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
[2024-05-23 00:07:18] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:18] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-05-23 00:07:18] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:07:18] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/81 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 105/186 variables, 81/102 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 114 constraints, problems are : Problem set: 0 solved, 101 unsolved in 7967 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:23] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:07:24] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/81 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:25] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-05-23 00:07:25] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:07:26] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:28] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-23 00:07:28] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:07:29] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:30] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 2 ms to minimize.
[2024-05-23 00:07:30] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 2 ms to minimize.
[2024-05-23 00:07:30] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:32] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:07:32] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2024-05-23 00:07:32] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:33] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:36] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 105/186 variables, 81/118 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 12/130 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/186 variables, 101/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:45] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/186 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/186 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-23 00:07:50] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/186 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/186 variables, and 233 constraints, problems are : Problem set: 0 solved, 101 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 29/29 constraints]
After SMT, in 38041ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 38043ms
Starting structural reductions in LTL mode, iteration 1 : 81/88 places, 105/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38450 ms. Remains : 81/88 places, 105/136 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLCardinality-11 finished in 38602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 136/136 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 80 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 80 transition count 104
Applied a total of 16 rules in 11 ms. Remains 80 /88 variables (removed 8) and now considering 104/136 (removed 32) transitions.
// Phase 1: matrix 104 rows 80 cols
[2024-05-23 00:07:53] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 00:07:53] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-23 00:07:53] [INFO ] Invariant cache hit.
[2024-05-23 00:07:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-23 00:07:53] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-23 00:07:53] [INFO ] Invariant cache hit.
[2024-05-23 00:07:53] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 00:07:54] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-23 00:07:54] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-23 00:07:55] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:07:55] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:07:55] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-23 00:07:55] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:07:55] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:07:55] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:07:55] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:07:55] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 00:07:57] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 00:07:57] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-05-23 00:07:57] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 00:07:58] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 00:07:58] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:07:58] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 00:07:59] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:07:59] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:07:59] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 104/184 variables, 80/109 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 0/184 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 121 constraints, problems are : Problem set: 0 solved, 100 unsolved in 9613 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 00:08:04] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:08:04] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:08:04] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 00:08:04] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 00:08:05] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-05-23 00:08:05] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 104/184 variables, 80/115 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 100/227 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 00:08:10] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
[2024-05-23 00:08:10] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-23 00:08:12] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-23 00:08:12] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:08:12] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-05-23 00:08:12] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:08:13] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 5/234 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/184 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 16 (OVERLAPS) 0/184 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 234 constraints, problems are : Problem set: 0 solved, 100 unsolved in 17603 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 32/32 constraints]
After SMT, in 27258ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 27260ms
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 104/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27612 ms. Remains : 80/88 places, 104/136 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 346 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)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-04-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-04-LTLCardinality-14 finished in 28216 ms.
All properties solved by simple procedures.
Total runtime 215311 ms.
BK_STOP 1716422901871
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Anderson-PT-04, 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 r004-smll-171620118300315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-04.tgz
mv Anderson-PT-04 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 '
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 ;