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

--------------------
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-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717207111082

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0010P1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:58:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 01:58:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:58:32] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2024-06-01 01:58:32] [INFO ] Transformed 25 places.
[2024-06-01 01:58:32] [INFO ] Transformed 18 transitions.
[2024-06-01 01:58:32] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 15 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-06-01 01:58:32] [INFO ] Computed 6 invariants in 6 ms
[2024-06-01 01:58:32] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-01 01:58:32] [INFO ] Invariant cache hit.
[2024-06-01 01:58:32] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 01:58:32] [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 233 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 195 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 450ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 458ms
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 687 ms. Remains : 23/25 places, 18/18 transitions.
Support contains 19 out of 23 places after structural reductions.
[2024-06-01 01:58:33] [INFO ] Flatten gal took : 15 ms
[2024-06-01 01:58:33] [INFO ] Flatten gal took : 5 ms
[2024-06-01 01:58:33] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 13037 steps (6 resets) in 123 ms. (105 steps per ms) remains 0/15 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((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.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 01:58:33] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 01:58:33] [INFO ] Implicit Places using invariants in 34 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 431 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-00
Product exploration explored 100000 steps with 1092 reset in 266 ms.
Product exploration explored 100000 steps with 1116 reset in 185 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 p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 832 steps (0 resets) in 5 ms. (138 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 01:58:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 01:58:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 01:58:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 01:58:35] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:58:35] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 01:58:35] [INFO ] Invariant cache hit.
[2024-06-01 01:58:35] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 01:58:35] [INFO ] Invariant cache hit.
[2024-06-01 01:58:35] [INFO ] Implicit Places using invariants and state equation in 33 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-06-01 01:58:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 293ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 294ms
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 832 steps (0 resets) in 6 ms. (118 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-06-01 01:58:36] [INFO ] Invariant cache hit.
[2024-06-01 01:58:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 01:58:36] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 01:58:36] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 01:58:36] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1131 reset in 117 ms.
Product exploration explored 100000 steps with 1160 reset in 133 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 8 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 16 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 16 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 16 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 15 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 15 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 24 rules in 12 ms. Remains 15 /21 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2024-06-01 01:58:37] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 15 cols
[2024-06-01 01:58:37] [INFO ] Computed 4 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 19 constraints, problems are : Problem set: 6 solved, 5 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 12/27 variables, 15/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 5/24 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 24 constraints, problems are : Problem set: 6 solved, 5 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 5/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 164ms problems are : Problem set: 6 solved, 5 unsolved
Search for dead transitions found 6 dead transitions in 164ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/21 places, 6/18 transitions.
Graph (complete) has 16 edges and 15 vertex of which 9 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 9 /15 variables (removed 6) and now considering 6/6 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 189 ms. Remains : 9/21 places, 6/18 transitions.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 01:58:37] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 01:58:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 01:58:37] [INFO ] Invariant cache hit.
[2024-06-01 01:58:38] [INFO ] Implicit Places using invariants and state equation in 32 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-06-01 01:58:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 265ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 266ms
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-00 finished in 4404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p0)||(G(!p0) U 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.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 01:58:38] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 01:58:38] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 01:58:38] [INFO ] Invariant cache hit.
[2024-06-01 01:58:38] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 01:58:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 287ms
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 323 ms :[p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-01
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-01 finished in 706 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.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-06-01 01:58:39] [INFO ] Invariant cache hit.
[2024-06-01 01:58:39] [INFO ] Implicit Places using invariants in 24 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 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 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-03 finished in 131 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||F((!p0 U (p1||G(!p0))))))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-06-01 01:58:39] [INFO ] Invariant cache hit.
[2024-06-01 01:58:39] [INFO ] Implicit Places using invariants in 29 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 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 33 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 111 ms :[false, false, (AND p0 (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-04
Product exploration explored 100000 steps with 1103 reset in 130 ms.
Product exploration explored 100000 steps with 1079 reset in 128 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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 91 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[false, (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 2065 steps (0 resets) in 15 ms. (129 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 185 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 79 ms :[false, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[false, (AND p0 (NOT p1))]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 20 transition count 10
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 11 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 9 transition count 7
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 24 place count 8 transition count 6
Applied a total of 24 rules in 7 ms. Remains 8 /20 variables (removed 12) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 01:58:40] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 01:58:40] [INFO ] Implicit Places using invariants in 20 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/20 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29 ms. Remains : 7/20 places, 6/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 96 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 69 ms :[false, (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 424 steps (0 resets) in 6 ms. (60 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 240 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 89 ms :[false, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[false, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[false, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1309 reset in 132 ms.
Stack based approach found an accepted trace after 223 steps with 4 reset with depth 91 and stack size 89 in 1 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-04 finished in 1808 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 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 9 transition count 6
Applied a total of 26 rules in 2 ms. Remains 9 /23 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-06-01 01:58:40] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 01:58:40] [INFO ] Implicit Places using invariants in 22 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/23 places, 6/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 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 2 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-06-01 01:58:40] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 01:58:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 01:58:40] [INFO ] Invariant cache hit.
[2024-06-01 01:58:41] [INFO ] Implicit Places using invariants and state equation in 16 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 : 5/23 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62 ms. Remains : 5/23 places, 4/18 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-05
Product exploration explored 100000 steps with 16 reset in 88 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-05 finished in 207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(!F(X(p1)) U p2)))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 0 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 01:58:41] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 01:58:41] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p2) p1), true, p1]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-06
Entered a terminal (fully accepting) state of product in 111 steps with 1 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-06 finished in 237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 01:58:41] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 01:58:41] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-07
Product exploration explored 100000 steps with 1517 reset in 92 ms.
Product exploration explored 100000 steps with 1487 reset in 94 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1714 steps (0 resets) in 8 ms. (190 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 01:58:42] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 01:58:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 01:58:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 01:58:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:58:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 01:58:42] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 01:58:42] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 01:58:42] [INFO ] Added : 12 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 9
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 10 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 10 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 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 3 with 2 rules applied. Total rules applied 26 place count 7 transition count 5
Applied a total of 26 rules in 1 ms. Remains 7 /20 variables (removed 13) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 01:58:42] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 01:58:42] [INFO ] Implicit Places using invariants in 16 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/20 places, 5/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18 ms. Remains : 6/20 places, 5/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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 298 steps (0 resets) in 6 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2024-06-01 01:58:42] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 01:58:42] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 01:58:42] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-06-01 01:58:42] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 01:58:42] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10182 reset in 58 ms.
Product exploration explored 100000 steps with 10190 reset in 47 ms.
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-06-01 01:58:42] [INFO ] Invariant cache hit.
[2024-06-01 01:58:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 01:58:42] [INFO ] Invariant cache hit.
[2024-06-01 01:58:42] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 01:58:42] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 01:58:42] [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 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]
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 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]
After SMT, in 61ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 61ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-07 finished in 1505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))||(p1&&X(!p0)))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 01:58:42] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 01:58:42] [INFO ] Implicit Places using invariants in 23 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 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 189 ms :[false, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-10
Product exploration explored 100000 steps with 25000 reset in 45 ms.
Product exploration explored 100000 steps with 25000 reset in 55 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 580 steps (0 resets) in 4 ms. (116 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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.
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 01:58:43] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 01:58:43] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 01:58:43] [INFO ] Invariant cache hit.
[2024-06-01 01:58:43] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 01:58:43] [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 130 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 110 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 264ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 264ms
Finished structural reductions in LTL mode , in 1 iterations and 308 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 580 steps (0 resets) in 4 ms. (116 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 40 ms.
Product exploration explored 100000 steps with 25000 reset in 49 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 17 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 17 transition count 15
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 17 transition count 15
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 14 transition count 12
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 14 transition count 12
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 26 rules in 8 ms. Remains 14 /20 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2024-06-01 01:58:45] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 14 cols
[2024-06-01 01:58:45] [INFO ] Computed 3 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
At refinement iteration 4 (OVERLAPS) 12/26 variables, 14/17 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 17 constraints, problems are : Problem set: 8 solved, 3 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/26 variables, 14/17 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 3/20 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/20 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/20 constraints. Problems are: Problem set: 8 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 20 constraints, problems are : Problem set: 8 solved, 3 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 3/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 8 solved, 3 unsolved
Search for dead transitions found 8 dead transitions in 106ms
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 : 14/20 places, 4/18 transitions.
Graph (complete) has 12 edges and 14 vertex of which 6 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 1 ms. Remains 6 /14 variables (removed 8) and now considering 4/4 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/20 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 121 ms. Remains : 6/20 places, 4/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 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 01:58:45] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 01:58:45] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 01:58:45] [INFO ] Invariant cache hit.
[2024-06-01 01:58:45] [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-06-01 01:58:45] [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 123 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 99 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 228ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 228ms
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-10 finished in 2920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U !p1)||(F(p2) U X(p0))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 01:58:45] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 01:58:45] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 01:58:45] [INFO ] Invariant cache hit.
[2024-06-01 01:58:45] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 01:58:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 257ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 257ms
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-11
Product exploration explored 100000 steps with 17688 reset in 63 ms.
Product exploration explored 100000 steps with 17664 reset in 68 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 (NOT p0) (NOT p2)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 215 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p2)]
RANDOM walk for 412 steps (0 resets) in 6 ms. (58 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0)]
Knowledge based reduction with 6 factoid took 347 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p2)]
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p2)]
[2024-06-01 01:58:48] [INFO ] Invariant cache hit.
[2024-06-01 01:58:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 01:58:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 01:58:48] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 01:58:48] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 01:58:48] [INFO ] Invariant cache hit.
[2024-06-01 01:58:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 01:58:48] [INFO ] Invariant cache hit.
[2024-06-01 01:58:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 01:58:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 242ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 242ms
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p2)]
RANDOM walk for 412 steps (0 resets) in 5 ms. (68 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0)]
Knowledge based reduction with 1 factoid took 216 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p2)]
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p2)]
[2024-06-01 01:58:49] [INFO ] Invariant cache hit.
[2024-06-01 01:58:49] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 01:58:49] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 01:58:49] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 01:58:49] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p2)]
Product exploration explored 100000 steps with 17677 reset in 56 ms.
Product exploration explored 100000 steps with 17727 reset in 54 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p2)]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 21 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 15 rules in 6 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2024-06-01 01:58:50] [INFO ] Redundant transitions in 1 ms returned []
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 19 cols
[2024-06-01 01:58:50] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
At refinement iteration 4 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/23 constraints. Problems are: Problem set: 9 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 23 constraints, problems are : Problem set: 9 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/19 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 6/29 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/29 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/29 constraints. Problems are: Problem set: 9 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 29 constraints, problems are : Problem set: 9 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 6/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 9 solved, 6 unsolved
Search for dead transitions found 9 dead transitions in 139ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 7/18 transitions.
Graph (complete) has 20 edges and 19 vertex of which 10 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 10 /19 variables (removed 9) and now considering 7/7 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/21 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 10/21 places, 7/18 transitions.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 01:58:50] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 01:58:50] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 01:58:50] [INFO ] Invariant cache hit.
[2024-06-01 01:58:50] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 01:58:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 310ms
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-11 finished in 5044 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.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Applied a total of 2 rules in 1 ms. Remains 21 /23 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-06-01 01:58:50] [INFO ] Invariant cache hit.
[2024-06-01 01:58:50] [INFO ] Implicit Places using invariants in 21 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 113 ms :[p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-12
Product exploration explored 100000 steps with 2214 reset in 78 ms.
Product exploration explored 100000 steps with 2222 reset in 80 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 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 96 ms :[p0, p0, p0]
RANDOM walk for 2538 steps (1 resets) in 8 ms. (282 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 112 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 115 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 115 ms :[p0, p0, p0]
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 01:58:51] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 01:58:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Proved EG p0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-12 finished in 1010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!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.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 14 transition count 11
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 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-06-01 01:58:51] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 01:58:51] [INFO ] Implicit Places using invariants in 22 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 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 1 ms. Remains 7 /8 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 01:58:51] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 01:58:51] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 01:58:51] [INFO ] Invariant cache hit.
[2024-06-01 01:58:51] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 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 64 ms. Remains : 7/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-13
Product exploration explored 100000 steps with 18067 reset in 48 ms.
Product exploration explored 100000 steps with 18167 reset in 50 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 p0) p1), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 150 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 128 ms :[(OR (NOT p0) p1), (NOT p0), p1]
RANDOM walk for 172 steps (0 resets) in 7 ms. (21 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 198 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 119 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) p1), (NOT p0), p1]
[2024-06-01 01:58:52] [INFO ] Invariant cache hit.
[2024-06-01 01:58:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 01:58:52] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 01:58:52] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 01:58:52] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 01:58:52] [INFO ] Invariant cache hit.
[2024-06-01 01:58:52] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 01:58:52] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-06-01 01:58:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:58:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 01:58:52] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 01:58:52] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 01:58:52] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG p1
Support contains 3 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-06-01 01:58:52] [INFO ] Invariant cache hit.
[2024-06-01 01:58:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 01:58:52] [INFO ] Invariant cache hit.
[2024-06-01 01:58:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-06-01 01:58:53] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 01:58:53] [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 33 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 33 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 70ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 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 (NOT p0) p1), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 118 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 120 ms :[(OR (NOT p0) p1), (NOT p0), p1]
RANDOM walk for 172 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 181 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 113 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p1), (NOT p0), p1]
[2024-06-01 01:58:53] [INFO ] Invariant cache hit.
[2024-06-01 01:58:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 01:58:53] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 01:58:53] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 01:58:53] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 01:58:53] [INFO ] Invariant cache hit.
[2024-06-01 01:58:53] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 01:58:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 01:58:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:58:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 01:58:53] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 01:58:53] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 01:58:53] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Product exploration explored 100000 steps with 18207 reset in 51 ms.
Product exploration explored 100000 steps with 18215 reset in 48 ms.
Support contains 3 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 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 01:58:54] [INFO ] Invariant cache hit.
[2024-06-01 01:58:54] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 01:58:54] [INFO ] Invariant cache hit.
[2024-06-01 01:58:54] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-06-01 01:58:54] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 01:58:54] [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 34 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 38 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 74ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 7/7 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-13 finished in 2402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0||G((!p1||X((G(p2) U (!p1&&G(p2))))))) U X(p3))))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 0 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 01:58:54] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 01:58:54] [INFO ] Implicit Places using invariants in 21 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 397 ms :[(NOT p3), (NOT p3), (NOT p3), (AND p1 (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (NOT p2) p1), p1, true, (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-14
Entered a terminal (fully accepting) state of product in 21 steps with 4 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-14 finished in 442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||F(p1)))))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0010P1-LTLFireability-00
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (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.
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 rules applied. Total rules applied 3 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 20 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 13 transition count 9
Applied a total of 19 rules in 4 ms. Remains 13 /23 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-06-01 01:58:54] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 01:58:55] [INFO ] Implicit Places using invariants in 33 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/23 places, 9/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 7
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 10 transition count 6
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 9 transition count 6
Applied a total of 6 rules in 1 ms. Remains 9 /12 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-06-01 01:58:55] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 01:58:55] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 01:58:55] [INFO ] Invariant cache hit.
[2024-06-01 01:58:55] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 9/23 places, 6/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 72 ms. Remains : 9/23 places, 6/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-00
Stuttering criterion allowed to conclude after 19134 steps with 48 reset in 16 ms.
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-00 finished in 371 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-00 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(F(p0)))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0010P1-LTLFireability-07
Stuttering acceptance computed with spot in 61 ms :[(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.
Discarding 2 places :
Implicit places reduction removed 2 places
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 8 rules applied. Total rules applied 8 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 13 transition count 10
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 24 place count 10 transition count 7
Applied a total of 24 rules in 7 ms. Remains 10 /23 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-06-01 01:58:55] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 01:58:55] [INFO ] Implicit Places using invariants in 23 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 8/23 places, 7/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 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 1 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-06-01 01:58:55] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 01:58:55] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 01:58:55] [INFO ] Invariant cache hit.
[2024-06-01 01:58:55] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 6/23 places, 5/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 68 ms. Remains : 6/23 places, 5/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLFireability-07
Product exploration explored 100000 steps with 10228 reset in 49 ms.
Product exploration explored 100000 steps with 10250 reset in 51 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 340 steps (0 resets) in 4 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:58:55] [INFO ] Invariant cache hit.
[2024-06-01 01:58:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 01:58:55] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 01:58:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:58:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 01:58:55] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 01:58:55] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 01:58:55] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (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 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 01:58:55] [INFO ] Invariant cache hit.
[2024-06-01 01:58:55] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 01:58:55] [INFO ] Invariant cache hit.
[2024-06-01 01:58:55] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 01:58:55] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 01:58:55] [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 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]
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 35 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 66ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 66ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 382 steps (0 resets) in 4 ms. (76 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-06-01 01:58:56] [INFO ] Invariant cache hit.
[2024-06-01 01:58:56] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 01:58:56] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-06-01 01:58:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 01:58:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 01:58:56] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 01:58:56] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 01:58:56] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10153 reset in 45 ms.
Product exploration explored 100000 steps with 10266 reset in 71 ms.
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-06-01 01:58:56] [INFO ] Invariant cache hit.
[2024-06-01 01:58:56] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 01:58:56] [INFO ] Invariant cache hit.
[2024-06-01 01:58:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 01:58:56] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 01:58:56] [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 29 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 67ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 67ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0010P1-LTLFireability-07 finished in 1680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))||(p1&&X(!p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U !p1)||(F(p2) U X(p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!p1))))'
[2024-06-01 01:58:57] [INFO ] Flatten gal took : 5 ms
[2024-06-01 01:58:57] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 01:58:57] [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 24880 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717207174980

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ClientsAndServers-PT-N0010P1-LTLFireability-00
ltl formula formula --ltl=/tmp/2282/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 50 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2282/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2282/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2282/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2282/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 25 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 24, there are 28 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~211 levels ~10000 states ~19816 transitions
pnml2lts-mc( 1/ 4): ~211 levels ~20000 states ~40864 transitions
pnml2lts-mc( 1/ 4): ~211 levels ~40000 states ~84204 transitions
pnml2lts-mc( 2/ 4): ~197 levels ~80000 states ~196400 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~573!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 72918
pnml2lts-mc( 0/ 4): unique states count: 73866
pnml2lts-mc( 0/ 4): unique transitions count: 180070
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 104790
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 73991
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1183
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 73991 states 180405 transitions, fanout: 2.438
pnml2lts-mc( 0/ 4): Total exploration time 0.360 sec (0.340 sec minimum, 0.353 sec on average)
pnml2lts-mc( 0/ 4): States per second: 205531, Transitions per second: 501125
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.2MB, 17.3 B/state, compr.: 17.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.2MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0010P1-LTLFireability-07
ltl formula formula --ltl=/tmp/2282/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 50 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2282/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2282/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2282/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2282/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 25 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 24, there are 20 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~573!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 639
pnml2lts-mc( 0/ 4): unique states count: 2051
pnml2lts-mc( 0/ 4): unique transitions count: 4511
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 308
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2060
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1429
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2060 states 4530 transitions, fanout: 2.199
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.010 sec minimum, 0.025 sec on average)
pnml2lts-mc( 0/ 4): States per second: 68667, Transitions per second: 151000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 25.8 B/state, compr.: 26.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0010P1-LTLFireability-10
ltl formula formula --ltl=/tmp/2282/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 50 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2282/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2282/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2282/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2282/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 25 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 24, there are 24 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7
pnml2lts-mc( 0/ 4): unique states count: 7
pnml2lts-mc( 0/ 4): unique transitions count: 7
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 16
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16 states 22 transitions, fanout: 1.375
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 72.0 B/state, compr.: 73.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0010P1-LTLFireability-11
ltl formula formula --ltl=/tmp/2282/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 50 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2282/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2282/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2282/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2282/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 25 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 24, there are 48 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2980
pnml2lts-mc( 0/ 4): unique states count: 2980
pnml2lts-mc( 0/ 4): unique transitions count: 4526
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2280
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4079
pnml2lts-mc( 0/ 4): - cum. max stack depth: 385
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4079 states 6769 transitions, fanout: 1.659
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 135967, Transitions per second: 225633
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 24.9 B/state, compr.: 25.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0010P1-LTLFireability-13
ltl formula formula --ltl=/tmp/2282/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 50 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2282/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2282/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2282/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2282/ltl_4_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 25 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 24, there are 25 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~141 levels ~10000 states ~18928 transitions
pnml2lts-mc( 3/ 4): ~141 levels ~20000 states ~38476 transitions
pnml2lts-mc( 3/ 4): ~141 levels ~40000 states ~77480 transitions
pnml2lts-mc( 3/ 4): ~141 levels ~80000 states ~155616 transitions
pnml2lts-mc( 3/ 4): ~141 levels ~160000 states ~339412 transitions
pnml2lts-mc( 3/ 4): ~141 levels ~320000 states ~733012 transitions
pnml2lts-mc( 3/ 4): ~192 levels ~640000 states ~1521984 transitions
pnml2lts-mc( 3/ 4): ~226 levels ~1280000 states ~3262976 transitions
pnml2lts-mc( 3/ 4): ~260 levels ~2560000 states ~6969400 transitions
pnml2lts-mc( 3/ 4): ~294 levels ~5120000 states ~14607804 transitions
pnml2lts-mc( 3/ 4): ~328 levels ~10240000 states ~30132336 transitions
pnml2lts-mc( 3/ 4): ~379 levels ~20480000 states ~61821440 transitions
pnml2lts-mc( 3/ 4): ~447 levels ~40960000 states ~126189980 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33552221
pnml2lts-mc( 0/ 4): unique states count: 33553092
pnml2lts-mc( 0/ 4): unique transitions count: 115475683
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 82048474
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33604729
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1115
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33604729 states 115746547 transitions, fanout: 3.444
pnml2lts-mc( 0/ 4): Total exploration time 36.490 sec (36.450 sec minimum, 36.472 sec on average)
pnml2lts-mc( 0/ 4): States per second: 920930, Transitions per second: 3172007
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 318.0MB, 9.9 B/state, compr.: 10.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/96.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 318.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ClientsAndServers-PT-N0010P1, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505800428"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;