fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r069-tall-171620504500427
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ClientsAndServers-PT-N0010P1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13753.235 1254766.00 3404228.00 1942.60 FF?FFF???FTFTTFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r069-tall-171620504500427.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-N0010P1, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504500427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 22:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 22:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 22:50 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-N0010P1-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716435721085

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-N0010P1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 03:42:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 03:42:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 03:42:02] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-05-23 03:42:02] [INFO ] Transformed 25 places.
[2024-05-23 03:42:02] [INFO ] Transformed 18 transitions.
[2024-05-23 03:42:02] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 128 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 5 formulas.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 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 23 transition count 18
Applied a total of 2 rules in 29 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-23 03:42:02] [INFO ] Computed 6 invariants in 7 ms
[2024-05-23 03:42:02] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-23 03:42:02] [INFO ] Invariant cache hit.
[2024-05-23 03:42:02] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 03:42:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/41 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 29 constraints, problems are : Problem set: 0 solved, 17 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 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/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/41 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/41 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 46 constraints, problems are : Problem set: 0 solved, 17 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 472ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 481ms
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 742 ms. Remains : 23/25 places, 18/18 transitions.
Support contains 18 out of 23 places after structural reductions.
[2024-05-23 03:42:03] [INFO ] Flatten gal took : 14 ms
[2024-05-23 03:42:03] [INFO ] Flatten gal took : 4 ms
[2024-05-23 03:42:03] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 40017 steps (18 resets) in 317 ms. (125 steps per ms) remains 4/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 3/3 properties
[2024-05-23 03:42:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 15/22 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 23/41 variables, and 6 constraints, problems are : Problem set: 3 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/23 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 33ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-23 03:42:04] [INFO ] Invariant cache hit.
[2024-05-23 03:42:04] [INFO ] Implicit Places using invariants in 30 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 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 38 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 136 steps with 0 reset in 4 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-01 finished in 390 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((!p0||F(p1)))))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
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 4 rules applied. Total rules applied 4 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 9 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 10 place count 18 transition count 13
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 3 with 6 rules applied. Total rules applied 16 place count 15 transition count 10
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 18 place count 13 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 18 place count 13 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 22 place count 11 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 4 with 2 rules applied. Total rules applied 24 place count 10 transition count 7
Applied a total of 24 rules in 19 ms. Remains 10 /23 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-05-23 03:42:04] [INFO ] Computed 4 invariants in 1 ms
[2024-05-23 03:42:04] [INFO ] Implicit Places using invariants in 29 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/23 places, 7/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 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-23 03:42:04] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 03:42:04] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 03:42:04] [INFO ] Invariant cache hit.
[2024-05-23 03:42:04] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/23 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 7/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 100 ms :[false, false, false]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-02
Product exploration explored 100000 steps with 13 reset in 167 ms.
Product exploration explored 100000 steps with 16 reset in 149 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 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[false, false, false]
RANDOM walk for 3359 steps (0 resets) in 14 ms. (223 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 193 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[false, false, false]
Stuttering acceptance computed with spot in 106 ms :[false, false, false]
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-23 03:42:05] [INFO ] Invariant cache hit.
[2024-05-23 03:42:05] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 03:42:05] [INFO ] Invariant cache hit.
[2024-05-23 03:42:05] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-23 03:42:05] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-23 03:42:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 86ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 7/7 places, 6/6 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 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[false, false, false]
RANDOM walk for 2549 steps (0 resets) in 7 ms. (318 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 200 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[false, false, false]
Stuttering acceptance computed with spot in 121 ms :[false, false, false]
Stuttering acceptance computed with spot in 114 ms :[false, false, false]
Product exploration explored 100000 steps with 13 reset in 88 ms.
Product exploration explored 100000 steps with 18 reset in 169 ms.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-23 03:42:06] [INFO ] Invariant cache hit.
[2024-05-23 03:42:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 03:42:06] [INFO ] Invariant cache hit.
[2024-05-23 03:42:06] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-23 03:42:06] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-23 03:42:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 7/7 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-02 finished in 2501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0)||(p1&&G(F(!p1))))))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-23 03:42:06] [INFO ] Computed 6 invariants in 2 ms
[2024-05-23 03:42:07] [INFO ] Implicit Places using invariants in 37 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 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 41 ms. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-03
Product exploration explored 100000 steps with 11 reset in 143 ms.
Product exploration explored 100000 steps with 8 reset in 184 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 96 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
RANDOM walk for 16332 steps (6 resets) in 36 ms. (441 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 239 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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.
// Phase 1: matrix 18 rows 22 cols
[2024-05-23 03:42:08] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 03:42:08] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-23 03:42:08] [INFO ] Invariant cache hit.
[2024-05-23 03:42:08] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 03:42:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 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/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 271ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 273ms
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 22/22 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 p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 167 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
RANDOM walk for 13529 steps (5 resets) in 19 ms. (676 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 186 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Product exploration explored 100000 steps with 12 reset in 133 ms.
Product exploration explored 100000 steps with 5 reset in 161 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, 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.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 7 place count 22 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 22 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 18 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 18 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 18 transition count 14
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 16 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 16 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 22 rules in 10 ms. Remains 16 /22 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2024-05-23 03:42:11] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 16 cols
[2024-05-23 03:42:11] [INFO ] Computed 5 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
At refinement iteration 5 (OVERLAPS) 12/28 variables, 16/21 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 21 constraints, problems are : Problem set: 4 solved, 7 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/5 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 12/28 variables, 16/21 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 7/28 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/28 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 28 constraints, problems are : Problem set: 4 solved, 7 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 7/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 4 solved, 7 unsolved
Search for dead transitions found 4 dead transitions in 149ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 8/18 transitions.
Graph (complete) has 19 edges and 16 vertex of which 12 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 12 /16 variables (removed 4) and now considering 8/8 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/22 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 12/22 places, 8/18 transitions.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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.
// Phase 1: matrix 18 rows 22 cols
[2024-05-23 03:42:11] [INFO ] Computed 5 invariants in 4 ms
[2024-05-23 03:42:11] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 03:42:11] [INFO ] Invariant cache hit.
[2024-05-23 03:42:11] [INFO ] Implicit Places using invariants and state equation in 30 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 03:42:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 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/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 314ms
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-03 finished in 4712 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(F((p0&&F(p1))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-23 03:42:11] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 03:42:11] [INFO ] Implicit Places using invariants in 24 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 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 26 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-06
Product exploration explored 100000 steps with 10 reset in 143 ms.
Product exploration explored 100000 steps with 11 reset in 151 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 p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 4392 steps (0 resets) in 8 ms. (488 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 20 cols
[2024-05-23 03:42:12] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 03:42:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-23 03:42:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:42:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:12] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-23 03:42:12] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 03:42:12] [INFO ] Added : 5 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-23 03:42:12] [INFO ] Invariant cache hit.
[2024-05-23 03:42:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-23 03:42:13] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 03:42:13] [INFO ] Added : 16 causal constraints over 4 iterations in 24 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 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.
[2024-05-23 03:42:13] [INFO ] Invariant cache hit.
[2024-05-23 03:42:13] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 03:42:13] [INFO ] Invariant cache hit.
[2024-05-23 03:42:13] [INFO ] Implicit Places using invariants and state equation in 37 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 03:42:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 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/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 246ms
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 20/20 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 p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 14032 steps (3 resets) in 12 ms. (1079 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-23 03:42:14] [INFO ] Invariant cache hit.
[2024-05-23 03:42:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:14] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-23 03:42:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:42:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-23 03:42:14] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 03:42:14] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-23 03:42:14] [INFO ] Invariant cache hit.
[2024-05-23 03:42:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:14] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-23 03:42:14] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 03:42:14] [INFO ] Added : 16 causal constraints over 4 iterations in 12 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 12 reset in 146 ms.
Product exploration explored 100000 steps with 10 reset in 138 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 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 7 place count 20 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 20 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 18 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 18 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 13 rules in 3 ms. Remains 18 /20 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2024-05-23 03:42:14] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 18 cols
[2024-05-23 03:42:14] [INFO ] Computed 3 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/18 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
At refinement iteration 4 (OVERLAPS) 16/34 variables, 18/21 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/21 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/34 variables, 0/21 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 21 constraints, problems are : Problem set: 7 solved, 8 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 18/18 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/10 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 16/34 variables, 18/21 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 8/29 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/29 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/34 variables, 0/29 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 29 constraints, problems are : Problem set: 7 solved, 8 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 8/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 7 solved, 8 unsolved
Search for dead transitions found 7 dead transitions in 154ms
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 : 18/20 places, 9/18 transitions.
Graph (complete) has 15 edges and 18 vertex of which 11 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 11 /18 variables (removed 7) and now considering 9/9 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/20 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 11/20 places, 9/18 transitions.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-23 03:42:15] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 03:42:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-23 03:42:15] [INFO ] Invariant cache hit.
[2024-05-23 03:42:15] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 03:42:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 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/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 266ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 267ms
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-06 finished in 3687 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||G(p1)))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
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 4 rules applied. Total rules applied 4 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 18 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 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 17 transition count 12
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 13 place count 16 transition count 12
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 3 with 6 rules applied. Total rules applied 19 place count 13 transition count 9
Applied a total of 19 rules in 2 ms. Remains 13 /23 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-05-23 03:42:15] [INFO ] Computed 5 invariants in 4 ms
[2024-05-23 03:42:15] [INFO ] Implicit Places using invariants in 24 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/23 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 12 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 11 transition count 8
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-05-23 03:42:15] [INFO ] Computed 4 invariants in 0 ms
[2024-05-23 03:42:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 03:42:15] [INFO ] Invariant cache hit.
[2024-05-23 03:42:15] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/23 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 11/23 places, 8/18 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-07
Product exploration explored 100000 steps with 8705 reset in 76 ms.
Product exploration explored 100000 steps with 5507 reset in 149 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 p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 517 steps (0 resets) in 4 ms. (103 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-23 03:42:16] [INFO ] Invariant cache hit.
[2024-05-23 03:42:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:16] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 03:42:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:42:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-23 03:42:16] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 03:42:16] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (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, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 03:42:16] [INFO ] Invariant cache hit.
[2024-05-23 03:42:16] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 03:42:16] [INFO ] Invariant cache hit.
[2024-05-23 03:42:16] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-23 03:42:16] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-23 03:42:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 22 constraints, problems are : Problem set: 0 solved, 7 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 11/11 places, 8/8 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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 517 steps (0 resets) in 5 ms. (86 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-23 03:42:17] [INFO ] Invariant cache hit.
[2024-05-23 03:42:17] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-23 03:42:17] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 03:42:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:42:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:17] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 03:42:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 03:42:17] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7028 reset in 121 ms.
Product exploration explored 100000 steps with 6365 reset in 124 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 03:42:17] [INFO ] Invariant cache hit.
[2024-05-23 03:42:17] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 03:42:17] [INFO ] Invariant cache hit.
[2024-05-23 03:42:17] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-23 03:42:17] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-23 03:42:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 22 constraints, problems are : Problem set: 0 solved, 7 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 11/11 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-07 finished in 2268 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(F(p0))))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-23 03:42:17] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 03:42:17] [INFO ] Implicit Places using invariants in 26 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 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/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-08
Product exploration explored 100000 steps with 1189 reset in 88 ms.
Product exploration explored 100000 steps with 1193 reset in 97 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1868 steps (0 resets) in 4 ms. (373 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-05-23 03:42:18] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 03:42:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:18] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-23 03:42:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:42:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:18] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-23 03:42:18] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 03:42:18] [INFO ] Added : 14 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 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.
[2024-05-23 03:42:18] [INFO ] Invariant cache hit.
[2024-05-23 03:42:18] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 03:42:18] [INFO ] Invariant cache hit.
[2024-05-23 03:42:18] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 03:42:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 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/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 223ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 224ms
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 20/20 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 7563 steps (9 resets) in 5 ms. (1260 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-23 03:42:19] [INFO ] Invariant cache hit.
[2024-05-23 03:42:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:19] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-23 03:42:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:42:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:19] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-23 03:42:19] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 03:42:19] [INFO ] Added : 14 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1217 reset in 93 ms.
Product exploration explored 100000 steps with 1219 reset in 93 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 16 transition count 14
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 21 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 23 rules in 6 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2024-05-23 03:42:20] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 15 cols
[2024-05-23 03:42:20] [INFO ] Computed 3 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/28 variables, 15/18 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 18 constraints, problems are : Problem set: 8 solved, 4 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/28 variables, 15/18 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 4/22 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 22 constraints, problems are : Problem set: 8 solved, 4 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 4/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 8 solved, 4 unsolved
Search for dead transitions found 8 dead transitions in 105ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/20 places, 5/18 transitions.
Graph (complete) has 13 edges and 15 vertex of which 7 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 0 ms. Remains 7 /15 variables (removed 8) and now considering 5/5 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/20 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 7/20 places, 5/18 transitions.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 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.
// Phase 1: matrix 18 rows 20 cols
[2024-05-23 03:42:20] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 03:42:20] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 03:42:20] [INFO ] Invariant cache hit.
[2024-05-23 03:42:20] [INFO ] Implicit Places using invariants and state equation in 30 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 03:42:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 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/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 239ms
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-08 finished in 2816 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 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
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 4 rules applied. Total rules applied 4 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 9 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 10 place count 18 transition count 13
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 3 with 6 rules applied. Total rules applied 16 place count 15 transition count 10
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 18 place count 13 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 18 place count 13 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 22 place count 11 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 4 with 2 rules applied. Total rules applied 24 place count 10 transition count 7
Applied a total of 24 rules in 3 ms. Remains 10 /23 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-05-23 03:42:20] [INFO ] Computed 4 invariants in 0 ms
[2024-05-23 03:42:20] [INFO ] Implicit Places using invariants in 18 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/23 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 22 ms. Remains : 8/23 places, 7/18 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-09
Product exploration explored 100000 steps with 4 reset in 100 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-09 finished in 180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-23 03:42:20] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 03:42:20] [INFO ] Implicit Places using invariants in 23 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 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 26 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 736 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-14 finished in 123 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((!p0||F(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(G((G(p0)||(p1&&G(F(!p1))))))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0010P1-LTLCardinality-03
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
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 4 rules applied. Total rules applied 4 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 9 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 10 place count 18 transition count 13
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 3 with 6 rules applied. Total rules applied 16 place count 15 transition count 10
Applied a total of 16 rules in 3 ms. Remains 15 /23 variables (removed 8) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 15 cols
[2024-05-23 03:42:21] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 03:42:21] [INFO ] Implicit Places using invariants in 22 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/23 places, 10/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 8
Applied a total of 4 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-23 03:42:21] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 03:42:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 03:42:21] [INFO ] Invariant cache hit.
[2024-05-23 03:42:21] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 12/23 places, 8/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 76 ms. Remains : 12/23 places, 8/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-03
Product exploration explored 100000 steps with 29 reset in 80 ms.
Stack based approach found an accepted trace after 121 steps with 0 reset with depth 122 and stack size 122 in 1 ms.
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-03 finished in 499 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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(F((p0&&F(p1))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0010P1-LTLCardinality-06
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 19 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 19 transition count 13
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 10 place count 18 transition count 13
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 12 place count 17 transition count 12
Applied a total of 12 rules in 7 ms. Remains 17 /23 variables (removed 6) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-23 03:42:21] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 03:42:21] [INFO ] Implicit Places using invariants in 21 ms returned [12, 15, 16]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 22 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/23 places, 12/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 9
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 6 place count 11 transition count 9
Applied a total of 6 rules in 0 ms. Remains 11 /14 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 11 cols
[2024-05-23 03:42:21] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 03:42:21] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-23 03:42:21] [INFO ] Invariant cache hit.
[2024-05-23 03:42:21] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 11/23 places, 9/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 67 ms. Remains : 11/23 places, 9/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-06
Product exploration explored 100000 steps with 11 reset in 90 ms.
Stack based approach found an accepted trace after 690 steps with 0 reset with depth 691 and stack size 691 in 1 ms.
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-06 finished in 409 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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||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(F(p0))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0010P1-LTLCardinality-08
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 23/23 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 23 transition count 12
Reduce places removed 6 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 16 transition count 11
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 15 place count 15 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 21 place count 12 transition count 8
Applied a total of 21 rules in 5 ms. Remains 12 /23 variables (removed 11) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-23 03:42:22] [INFO ] Computed 5 invariants in 0 ms
[2024-05-23 03:42:22] [INFO ] Implicit Places using invariants in 29 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/23 places, 8/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 3 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-23 03:42:22] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 03:42:22] [INFO ] Implicit Places using invariants in 19 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 6/23 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 58 ms. Remains : 6/23 places, 5/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-08
Product exploration explored 100000 steps with 10332 reset in 53 ms.
Product exploration explored 100000 steps with 10256 reset in 54 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 358 steps (0 resets) in 4 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2024-05-23 03:42:22] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 03:42:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 03:42:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:42:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:22] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 03:42:22] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 03:42:22] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-23 03:42:22] [INFO ] Invariant cache hit.
[2024-05-23 03:42:22] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 03:42:22] [INFO ] Invariant cache hit.
[2024-05-23 03:42:22] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-05-23 03:42:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 6/6 places, 5/5 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 362 steps (0 resets) in 4 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-23 03:42:23] [INFO ] Invariant cache hit.
[2024-05-23 03:42:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 03:42:23] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 03:42:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 03:42:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 03:42:23] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 03:42:23] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 03:42:23] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10251 reset in 54 ms.
Product exploration explored 100000 steps with 10176 reset in 67 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-23 03:42:23] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-23 03:42:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 6/6 places, 5/5 transitions.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-23 03:42:24] [INFO ] Invariant cache hit.
[2024-05-23 03:42:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 03:42:24] [INFO ] Invariant cache hit.
[2024-05-23 03:42:24] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-05-23 03:42:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 61ms
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-08 finished in 2268 ms.
[2024-05-23 03:42:24] [INFO ] Flatten gal took : 2 ms
[2024-05-23 03:42:24] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 03:42:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 18 transitions and 50 arcs took 3 ms.
Total runtime 21912 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ClientsAndServers-PT-N0010P1

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/410/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: 2003
MODEL NAME: /home/mcc/execution/410/model
23 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-N0010P1-LTLCardinality-02 CANNOT_COMPUTE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-03 CANNOT_COMPUTE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-06 CANNOT_COMPUTE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-07 CANNOT_COMPUTE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-08 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716436975851

--------------------
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
Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

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-N0010P1"
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-N0010P1, 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-171620504500427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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