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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 22:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 22:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N0020P1-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716438052003

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0020P1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 04:20:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 04:20:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 04:20:53] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-05-23 04:20:53] [INFO ] Transformed 25 places.
[2024-05-23 04:20:53] [INFO ] Transformed 18 transitions.
[2024-05-23 04:20:53] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 17 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-23 04:20:53] [INFO ] Computed 7 invariants in 4 ms
[2024-05-23 04:20:53] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-23 04:20:53] [INFO ] Invariant cache hit.
[2024-05-23 04:20:53] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 04:20:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 31 constraints, problems are : Problem set: 0 solved, 17 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 48 constraints, problems are : Problem set: 0 solved, 17 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 465ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 474ms
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 704 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 21 out of 24 places after structural reductions.
[2024-05-23 04:20:54] [INFO ] Flatten gal took : 15 ms
[2024-05-23 04:20:54] [INFO ] Flatten gal took : 5 ms
[2024-05-23 04:20:54] [INFO ] Input system was already deterministic with 18 transitions.
Support contains 20 out of 24 places (down from 21) after GAL structural reductions.
RANDOM walk for 40127 steps (12 resets) in 280 ms. (142 steps per ms) remains 2/33 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
[2024-05-23 04:20:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp31 is UNSAT
After SMT solving in domain Real declared 24/42 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-23 04:20:55] [INFO ] Computed 6 invariants in 3 ms
[2024-05-23 04:20:55] [INFO ] Implicit Places using invariants in 30 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-03
Product exploration explored 100000 steps with 1 reset in 318 ms.
Product exploration explored 100000 steps with 1 reset in 290 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 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 125 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40207 steps (16 resets) in 45 ms. (874 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
// Phase 1: matrix 18 rows 22 cols
[2024-05-23 04:20:56] [INFO ] Computed 5 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 12/40 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/22 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 304 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 15 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 15 transition count 8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 12 transition count 8
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 3 with 2 rules applied. Total rules applied 22 place count 11 transition count 7
Applied a total of 22 rules in 19 ms. Remains 11 /22 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2024-05-23 04:20:56] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 04:20:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 04:20:56] [INFO ] Invariant cache hit.
[2024-05-23 04:20:56] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-23 04:20:56] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 04:20:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 11/22 places, 7/18 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 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 265 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40054 steps (16 resets) in 142 ms. (280 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2024-05-23 04:20:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 7/18 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/11 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 527 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5 reset in 99 ms.
Product exploration explored 100000 steps with 4 reset in 131 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-23 04:20:58] [INFO ] Invariant cache hit.
[2024-05-23 04:20:58] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-23 04:20:58] [INFO ] Invariant cache hit.
[2024-05-23 04:20:58] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-23 04:20:58] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 04:20:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 11/11 places, 7/7 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-03 finished in 3513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 13 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 11 transition count 8
Applied a total of 23 rules in 3 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-05-23 04:20:58] [INFO ] Computed 4 invariants in 0 ms
[2024-05-23 04:20:58] [INFO ] Implicit Places using invariants in 24 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 places, 8/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2024-05-23 04:20:58] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 04:20:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 04:20:58] [INFO ] Invariant cache hit.
[2024-05-23 04:20:58] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-04
Stuttering criterion allowed to conclude after 48908 steps with 0 reset in 53 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-04 finished in 184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(F(!p0)))) U (F(p1) U X(p2))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-23 04:20:58] [INFO ] Computed 4 invariants in 1 ms
[2024-05-23 04:20:58] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-23 04:20:58] [INFO ] Invariant cache hit.
[2024-05-23 04:20:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 04:20:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 284ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 284ms
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 391 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-06
Product exploration explored 100000 steps with 2802 reset in 181 ms.
Product exploration explored 100000 steps with 3301 reset in 262 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 (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 12 factoid took 489 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 17089 steps (3 resets) in 24 ms. (683 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (OR p2 p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F p1), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 751 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 411 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
[2024-05-23 04:21:02] [INFO ] Invariant cache hit.
[2024-05-23 04:21:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 04:21:02] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-23 04:21:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:21:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 04:21:02] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 04:21:02] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 04:21:02] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-23 04:21:02] [INFO ] Invariant cache hit.
[2024-05-23 04:21:02] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 04:21:02] [INFO ] Invariant cache hit.
[2024-05-23 04:21:02] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 04:21:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 257ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 257ms
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 21/21 places, 18/18 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 (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 323 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 12798 steps (1 resets) in 13 ms. (914 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F p1), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 734 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 466 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
[2024-05-23 04:21:05] [INFO ] Invariant cache hit.
[2024-05-23 04:21:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 04:21:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-23 04:21:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:21:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 04:21:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-23 04:21:05] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 04:21:05] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 368 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1413 reset in 162 ms.
Product exploration explored 100000 steps with 1559 reset in 175 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, true, false]
Stuttering acceptance computed with spot in 367 ms :[(NOT p2), false, (NOT p2), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 19 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 19 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 13 rules in 10 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2024-05-23 04:21:06] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 19 cols
[2024-05-23 04:21:06] [INFO ] Computed 4 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
At refinement iteration 4 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 23 constraints, problems are : Problem set: 7 solved, 8 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/19 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 8/31 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/31 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 31 constraints, problems are : Problem set: 7 solved, 8 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 8/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 175ms problems are : Problem set: 7 solved, 8 unsolved
Search for dead transitions found 7 dead transitions in 175ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 9/18 transitions.
Graph (complete) has 22 edges and 19 vertex of which 12 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 12 /19 variables (removed 7) and now considering 9/9 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/21 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 12/21 places, 9/18 transitions.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-23 04:21:06] [INFO ] Computed 4 invariants in 1 ms
[2024-05-23 04:21:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 04:21:06] [INFO ] Invariant cache hit.
[2024-05-23 04:21:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 04:21:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 269ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 269ms
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-06 finished in 8251 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(G(p0))&&(X(X(p1)) U ((p2&&X(X(p1)))||X(X(G(p1))))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-23 04:21:06] [INFO ] Computed 5 invariants in 0 ms
[2024-05-23 04:21:06] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-07
Product exploration explored 100000 steps with 728 reset in 137 ms.
Product exploration explored 100000 steps with 723 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 p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 173 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
RANDOM walk for 29767 steps (12 resets) in 19 ms. (1488 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 499 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
// Phase 1: matrix 18 rows 21 cols
[2024-05-23 04:21:09] [INFO ] Computed 4 invariants in 0 ms
[2024-05-23 04:21:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:21:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:21:09] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 04:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:21:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:21:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:21:09] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-23 04:21:09] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 04:21:09] [INFO ] Added : 10 causal constraints over 2 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-23 04:21:09] [INFO ] Invariant cache hit.
[2024-05-23 04:21:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:21:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:21:09] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 04:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:21:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 04:21:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:21:09] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-23 04:21:09] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 04:21:09] [INFO ] Added : 15 causal constraints over 3 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-23 04:21:09] [INFO ] Invariant cache hit.
[2024-05-23 04:21:09] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 04:21:09] [INFO ] Invariant cache hit.
[2024-05-23 04:21:09] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 04:21:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 262ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 262ms
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 21/21 places, 18/18 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 (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 273 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
RANDOM walk for 5526 steps (0 resets) in 12 ms. (425 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 636 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
[2024-05-23 04:21:11] [INFO ] Invariant cache hit.
[2024-05-23 04:21:11] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 04:21:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:21:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-23 04:21:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:21:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:21:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:21:11] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-23 04:21:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 04:21:11] [INFO ] Added : 10 causal constraints over 2 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-23 04:21:11] [INFO ] Invariant cache hit.
[2024-05-23 04:21:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:21:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:21:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-23 04:21:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:21:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:21:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:21:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-23 04:21:11] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 04:21:11] [INFO ] Added : 15 causal constraints over 3 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, (NOT p1), false, false, false]
Product exploration explored 100000 steps with 687 reset in 134 ms.
Product exploration explored 100000 steps with 675 reset in 150 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-23 04:21:12] [INFO ] Invariant cache hit.
[2024-05-23 04:21:12] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-23 04:21:12] [INFO ] Invariant cache hit.
[2024-05-23 04:21:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 04:21:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 253ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 255ms
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-07 finished in 6054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&X(p1)))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-23 04:21:12] [INFO ] Computed 4 invariants in 0 ms
[2024-05-23 04:21:12] [INFO ] Implicit Places using invariants in 22 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-09
Product exploration explored 100000 steps with 538 reset in 118 ms.
Product exploration explored 100000 steps with 540 reset in 123 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 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40106 steps (14 resets) in 22 ms. (1743 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
// Phase 1: matrix 18 rows 20 cols
[2024-05-23 04:21:13] [INFO ] Computed 3 invariants in 1 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 2/38 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 11 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 13ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-23 04:21:14] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND p0 (NOT p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-09 finished in 1545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G((F(p1)&&(X(p2) U G(p2))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-23 04:21:14] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 04:21:14] [INFO ] Implicit Places using invariants in 30 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-10
Product exploration explored 100000 steps with 346 reset in 112 ms.
Product exploration explored 100000 steps with 318 reset in 142 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 (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 172 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
RANDOM walk for 3562 steps (0 resets) in 8 ms. (395 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0))), (F p1), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 12 factoid took 369 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p0), (AND (NOT p0) p2)]
// Phase 1: matrix 18 rows 21 cols
[2024-05-23 04:21:16] [INFO ] Computed 4 invariants in 1 ms
Proved EG (NOT p1)
[2024-05-23 04:21:16] [INFO ] Invariant cache hit.
[2024-05-23 04:21:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:21:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0))), (F p1), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p2) p0))), (G (NOT p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 12 factoid took 420 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-10 finished in 2222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||F(p2))) U G((F(!p1) U p0))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 20 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 18 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9 place count 18 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 15 place count 15 transition count 12
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 3 with 2 rules applied. Total rules applied 17 place count 14 transition count 11
Applied a total of 17 rules in 6 ms. Remains 14 /24 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-23 04:21:16] [INFO ] Computed 4 invariants in 1 ms
[2024-05-23 04:21:16] [INFO ] Implicit Places using invariants in 22 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/24 places, 11/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 11 transition count 9
Applied a total of 4 rules in 2 ms. Remains 11 /13 variables (removed 2) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2024-05-23 04:21:16] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 04:21:16] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 04:21:16] [INFO ] Invariant cache hit.
[2024-05-23 04:21:16] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/24 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74 ms. Remains : 11/24 places, 9/18 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-11
Product exploration explored 100000 steps with 67 reset in 109 ms.
Stack based approach found an accepted trace after 53882 steps with 36 reset with depth 1016 and stack size 1015 in 66 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-11 finished in 505 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(p0)&&G((F(p1)||X((p2 U p3)))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-23 04:21:17] [INFO ] Computed 4 invariants in 1 ms
[2024-05-23 04:21:17] [INFO ] Implicit Places using invariants in 30 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-12
Product exploration explored 100000 steps with 620 reset in 128 ms.
Product exploration explored 100000 steps with 726 reset in 126 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 p3 p2), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 7 factoid took 157 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1)]
RANDOM walk for 40046 steps (12 resets) in 29 ms. (1334 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
// Phase 1: matrix 18 rows 20 cols
[2024-05-23 04:21:18] [INFO ] Computed 3 invariants in 0 ms
Problem apf4 is UNSAT
After SMT solving in domain Real declared 3/38 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 11 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 13ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p3 p2), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p0)), (G (OR p1 p2 p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 237 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 15 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 10 transition count 8
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 3 with 2 rules applied. Total rules applied 22 place count 9 transition count 7
Applied a total of 22 rules in 2 ms. Remains 9 /20 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-23 04:21:18] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 04:21:18] [INFO ] Implicit Places using invariants in 22 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/20 places, 7/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25 ms. Remains : 8/20 places, 7/18 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 p3), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
RANDOM walk for 3049 steps (1 resets) in 7 ms. (381 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p3), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT p1)), (F (NOT (OR p3 p1)))]
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 278 reset in 80 ms.
Product exploration explored 100000 steps with 265 reset in 84 ms.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 8 cols
[2024-05-23 04:21:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:21:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 04:21:19] [INFO ] Invariant cache hit.
[2024-05-23 04:21:19] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-23 04:21:19] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 04:21:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 6 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 8/8 places, 7/7 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-12 finished in 2426 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((X(X(X(p1)))&&p0))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-23 04:21:19] [INFO ] Computed 4 invariants in 1 ms
[2024-05-23 04:21:19] [INFO ] Implicit Places using invariants in 25 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-13 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
[2024-05-23 04:21:19] [INFO ] Invariant cache hit.
[2024-05-23 04:21:19] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Product exploration explored 100000 steps with 50000 reset in 55 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 (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-14 finished in 470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0020P1-LTLCardinality-03
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 18 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 18 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 16 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 14 transition count 9
Applied a total of 19 rules in 5 ms. Remains 14 /24 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 14 cols
[2024-05-23 04:21:20] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 04:21:20] [INFO ] Implicit Places using invariants in 25 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/24 places, 9/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 12 transition count 7
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 4 place count 11 transition count 7
Applied a total of 4 rules in 3 ms. Remains 11 /13 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 11 cols
[2024-05-23 04:21:20] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 04:21:20] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 04:21:20] [INFO ] Invariant cache hit.
[2024-05-23 04:21:20] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 11/24 places, 7/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 74 ms. Remains : 11/24 places, 7/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLCardinality-03
Product exploration explored 100000 steps with 5 reset in 86 ms.
Product exploration explored 100000 steps with 3 reset in 99 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 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 313 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40060 steps (20 resets) in 24 ms. (1602 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2024-05-23 04:21:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 7/18 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/11 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 515 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-23 04:21:21] [INFO ] Invariant cache hit.
[2024-05-23 04:21:21] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-23 04:21:21] [INFO ] Invariant cache hit.
[2024-05-23 04:21:22] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-23 04:21:22] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 04:21:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 11/11 places, 7/7 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 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40087 steps (17 resets) in 20 ms. (1908 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-05-23 04:21:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 7/18 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/11 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 570 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4 reset in 97 ms.
Product exploration explored 100000 steps with 2 reset in 104 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-23 04:21:23] [INFO ] Invariant cache hit.
[2024-05-23 04:21:23] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 04:21:23] [INFO ] Invariant cache hit.
[2024-05-23 04:21:23] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-23 04:21:23] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 04:21:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/18 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 132ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 11/11 places, 7/7 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLCardinality-03 finished in 3392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(F(!p0)))) U (F(p1) U X(p2))))'
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(G(p0))&&(X(X(p1)) U ((p2&&X(X(p1)))||X(X(G(p1))))))))'
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(p0)&&G((F(p1)||X((p2 U p3)))))))'
[2024-05-23 04:21:24] [INFO ] Flatten gal took : 7 ms
[2024-05-23 04:21:24] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 04:21:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 18 transitions and 52 arcs took 0 ms.
Total runtime 31051 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ClientsAndServers-PT-N0020P1

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/402/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 24
TRANSITIONS: 18
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


SAVING FILE /home/mcc/execution/402/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2457
MODEL NAME: /home/mcc/execution/402/model
24 places, 18 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-03 CANNOT_COMPUTE
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-06 CANNOT_COMPUTE
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-07 CANNOT_COMPUTE
FORMULA ClientsAndServers-PT-N0020P1-LTLCardinality-12 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716439193514

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="ClientsAndServers-PT-N0020P1"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ClientsAndServers-PT-N0020P1, 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 r069-tall-171620504500451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0020P1.tgz
mv ClientsAndServers-PT-N0020P1 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;