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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.6K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 23:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 23:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 23:04 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-N0020P2-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716304865244

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0020P2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 15:21:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 15:21:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:21:06] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2024-05-21 15:21:06] [INFO ] Transformed 25 places.
[2024-05-21 15:21:06] [INFO ] Transformed 18 transitions.
[2024-05-21 15:21:06] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 25 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-21 15:21:06] [INFO ] Computed 7 invariants in 6 ms
[2024-05-21 15:21:06] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 15:21:06] [INFO ] Invariant cache hit.
[2024-05-21 15:21:06] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 15:21:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 31 constraints, problems are : Problem set: 0 solved, 17 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 48 constraints, problems are : Problem set: 0 solved, 17 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 443ms
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 694 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 20 out of 24 places after structural reductions.
[2024-05-21 15:21:07] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:21:07] [INFO ] Flatten gal took : 4 ms
[2024-05-21 15:21:07] [INFO ] Input system was already deterministic with 18 transitions.
Reduction of identical properties reduced properties to check from 22 to 21
RANDOM walk for 40202 steps (12 resets) in 196 ms. (204 steps per ms) remains 1/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 288 ms. (138 steps per ms) remains 1/1 properties
[2024-05-21 15:21:07] [INFO ] Invariant cache hit.
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 3/42 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 18ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 19 transition count 15
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 8 place count 19 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 16 place count 15 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 14 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 4 with 4 rules applied. Total rules applied 21 place count 12 transition count 9
Applied a total of 21 rules in 24 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-21 15:21:08] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 15:21:08] [INFO ] Implicit Places using invariants in 23 ms returned [9, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/24 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 10 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 8 transition count 7
Applied a total of 4 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 8 cols
[2024-05-21 15:21:08] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 15:21:08] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-21 15:21:08] [INFO ] Invariant cache hit.
[2024-05-21 15:21:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-01
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-01 finished in 325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(p2)||p1)))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 15:21:08] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:21:08] [INFO ] Implicit Places using invariants in 33 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-02
Stuttering criterion allowed to conclude after 15760 steps with 0 reset in 107 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-02 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F(!p1) U p2))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 7 place count 20 transition count 13
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 11 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 17 transition count 12
Applied a total of 13 rules in 6 ms. Remains 17 /24 variables (removed 7) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-21 15:21:08] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 15:21:08] [INFO ] Implicit Places using invariants in 21 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/24 places, 12/18 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 11
Applied a total of 2 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-05-21 15:21:08] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 15:21:08] [INFO ] Implicit Places using invariants in 20 ms returned [14]
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 2 : 14/24 places, 11/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 52 ms. Remains : 14/24 places, 11/18 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-04
Product exploration explored 100000 steps with 10302 reset in 173 ms.
Product exploration explored 100000 steps with 10295 reset in 151 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
RANDOM walk for 2714 steps (1 resets) in 6 ms. (387 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 7 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 11 rows 14 cols
[2024-05-21 15:21:09] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:21:09] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:09] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 15:21:09] [INFO ] Computed and/alt/rep : 10/11/10 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 15:21:09] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-21 15:21:09] [INFO ] Invariant cache hit.
[2024-05-21 15:21:09] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 15:21:09] [INFO ] Invariant cache hit.
[2024-05-21 15:21:09] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-21 15:21:09] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-21 15:21:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 11/25 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 11/25 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/25 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 28 constraints, problems are : Problem set: 0 solved, 10 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 14/14 places, 11/11 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 p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 69 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
RANDOM walk for 1950 steps (0 resets) in 4 ms. (390 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 7 factoid took 191 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-21 15:21:10] [INFO ] Invariant cache hit.
[2024-05-21 15:21:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-21 15:21:10] [INFO ] Computed and/alt/rep : 10/11/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 15:21:10] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10263 reset in 160 ms.
Product exploration explored 100000 steps with 10224 reset in 97 ms.
Built C files in :
/tmp/ltsmin3294168826495248712
[2024-05-21 15:21:10] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2024-05-21 15:21:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:21:10] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2024-05-21 15:21:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:21:10] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2024-05-21 15:21:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:21:10] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3294168826495248712
Running compilation step : cd /tmp/ltsmin3294168826495248712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 237 ms.
Running link step : cd /tmp/ltsmin3294168826495248712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3294168826495248712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3652184974307216200.hoa' '--buchi-type=spotba'
LTSmin run took 387 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-04 finished in 2548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 15:21:11] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 15:21:11] [INFO ] Implicit Places using invariants in 26 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-05
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-05 finished in 155 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 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 15:21:11] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:21:11] [INFO ] Implicit Places using invariants in 26 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-06
Product exploration explored 100000 steps with 1492 reset in 108 ms.
Product exploration explored 100000 steps with 1503 reset in 106 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 76 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 51 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4254 steps (0 resets) in 12 ms. (327 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 102 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 79 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 15:21:12] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 15:21:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 15:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:21:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-21 15:21:12] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:21:12] [INFO ] Added : 12 causal constraints over 3 iterations in 17 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 3 ms. Remains 7 /20 variables (removed 13) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-21 15:21:12] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 15:21:12] [INFO ] Implicit Places using invariants in 19 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 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 23 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 76 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 49 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 578 steps (0 resets) in 4 ms. (115 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 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2024-05-21 15:21:12] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 15:21:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 15:21:12] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:21:12] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10299 reset in 49 ms.
Product exploration explored 100000 steps with 10212 reset in 108 ms.
Built C files in :
/tmp/ltsmin17955411104315412289
[2024-05-21 15:21:12] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-21 15:21:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:21:12] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-21 15:21:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:21:12] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-21 15:21:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:21:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17955411104315412289
Running compilation step : cd /tmp/ltsmin17955411104315412289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin17955411104315412289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17955411104315412289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased222875294120290481.hoa' '--buchi-type=spotba'
LTSmin run took 293 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-06 finished in 1922 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 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 15:21:13] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 15:21:13] [INFO ] Implicit Places using invariants in 24 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-07
Product exploration explored 100000 steps with 1235 reset in 169 ms.
Product exploration explored 100000 steps with 1194 reset in 129 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(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 81 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3956 steps (0 resets) in 7 ms. (494 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 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 15:21:14] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 15:21:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 15:21:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:21:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:14] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 15:21:14] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 15:21:14] [INFO ] Added : 14 causal constraints over 3 iterations in 10 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.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 11 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 18 place count 11 transition count 6
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 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 7 transition count 5
Applied a total of 26 rules in 2 ms. Remains 7 /20 variables (removed 13) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-21 15:21:14] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 15:21:14] [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 1 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 20 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 89 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 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 818 steps (1 resets) in 8 ms. (90 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 89 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 65 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2024-05-21 15:21:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 15:21:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:14] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 15:21:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:21:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 15:21:14] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-21 15:21:14] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:21:14] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10247 reset in 51 ms.
Product exploration explored 100000 steps with 10273 reset in 53 ms.
Built C files in :
/tmp/ltsmin7398399177706353877
[2024-05-21 15:21:14] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-21 15:21:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:21:14] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-21 15:21:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:21:14] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-21 15:21:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:21:14] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7398399177706353877
Running compilation step : cd /tmp/ltsmin7398399177706353877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin7398399177706353877;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7398399177706353877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3297523490867614528.hoa' '--buchi-type=spotba'
LTSmin run took 285 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-07 finished in 1926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&F(!p0)))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 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 22 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 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 3 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-05-21 15:21:15] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 15:21:15] [INFO ] Implicit Places using invariants in 30 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 9/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Applied a total of 4 rules in 3 ms. Remains 9 /11 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-21 15:21:15] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 15:21:15] [INFO ] Implicit Places using invariants in 20 ms returned [8]
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 2 : 8/24 places, 7/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 58 ms. Remains : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-08
Product exploration explored 100000 steps with 10170 reset in 51 ms.
Product exploration explored 100000 steps with 10228 reset in 55 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 78 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 1146 steps (1 resets) in 8 ms. (127 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 7 rows 8 cols
[2024-05-21 15:21:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 15:21:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:15] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-21 15:21:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:21:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 15:21:15] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 15:21:15] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-21 15:21:15] [INFO ] Invariant cache hit.
[2024-05-21 15:21:15] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 15:21:15] [INFO ] Invariant cache hit.
[2024-05-21 15:21:15] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-21 15:21:15] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-21 15:21:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 6 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 8/8 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 64 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 824 steps (0 resets) in 5 ms. (137 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-21 15:21:16] [INFO ] Invariant cache hit.
[2024-05-21 15:21:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:16] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 15:21:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:21:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 15:21:16] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 15:21:16] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10185 reset in 53 ms.
Product exploration explored 100000 steps with 10204 reset in 55 ms.
Built C files in :
/tmp/ltsmin10177849398848691046
[2024-05-21 15:21:16] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-21 15:21:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:21:16] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-21 15:21:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:21:16] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-21 15:21:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:21:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10177849398848691046
Running compilation step : cd /tmp/ltsmin10177849398848691046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 87 ms.
Running link step : cd /tmp/ltsmin10177849398848691046;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10177849398848691046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6762719051484108651.hoa' '--buchi-type=spotba'
LTSmin run took 155 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-08 finished in 1659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1) U X((p2||G(!p3)||F(p4)))))'
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 15:21:16] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 15:21:16] [INFO ] Implicit Places using invariants in 23 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 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 26 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-10
Product exploration explored 100000 steps with 4572 reset in 93 ms.
Product exploration explored 100000 steps with 4497 reset in 92 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4)), (X (NOT p2)), (X p3), (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4)))), (X (NOT p4)), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3) (NOT p4)))), (X (AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4))), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) p0 (NOT p2) p3 (NOT p4)))), (X (AND (NOT p2) p3 (NOT p4))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4))))), (X (X (AND (NOT p1) (NOT p0) p3 (NOT p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4)))), (X (X (AND (NOT p1) (NOT p0) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3 (NOT p4))))), (X (X (AND (NOT p2) p3 (NOT p4)))), (X (X (NOT p0))), (X (X (AND p3 (NOT p4)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 171 ms. Reduced automaton from 8 states, 22 edges and 5 AP (stutter sensitive) to 8 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
RANDOM walk for 17426 steps (3 resets) in 25 ms. (670 steps per ms) remains 0/23 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4)), (X (NOT p2)), (X p3), (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4)))), (X (NOT p4)), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3) (NOT p4)))), (X (AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4))), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) p0 (NOT p2) p3 (NOT p4)))), (X (AND (NOT p2) p3 (NOT p4))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4))))), (X (X (AND (NOT p1) (NOT p0) p3 (NOT p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4)))), (X (X (AND (NOT p1) (NOT p0) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3 (NOT p4))))), (X (X (AND (NOT p2) p3 (NOT p4)))), (X (X (NOT p0))), (X (X (AND p3 (NOT p4)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p3 p4))), (F (NOT (OR p1 p2 p3 p4 (NOT p0)))), (F (NOT (OR p1 p2 p3 p4 p0))), (F (NOT (OR p1 (NOT p3) p4 (NOT p0)))), (F p4), (F (NOT (OR p1 p2 p4 (NOT p0)))), (F (NOT (AND (OR (NOT p1) p2 p3 p4) (OR p2 p3 p4 p0)))), (F (NOT (OR p1 p2 (NOT p3) p4 (NOT p0)))), (F (NOT (OR p2 p3 p4))), (F (NOT (AND (NOT p1) p3 (NOT p4) (NOT p0)))), (F (NOT (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p0))))), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p4) (NOT p0)))), (F (NOT (AND (NOT p2) p3 (NOT p4)))), (F (NOT p3)), (F (NOT (OR p1 p3 p4 p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0)))), (F (NOT (AND p3 (NOT p4)))), (F (NOT (OR p1 p4 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0)))), (F (NOT (OR p1 p3 p4 (NOT p0)))), (F p1)]
Knowledge based reduction with 39 factoid took 1164 ms. Reduced automaton from 8 states, 21 edges and 5 AP (stutter sensitive) to 8 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 15:21:19] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:21:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 15:21:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:21:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 15:21:19] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-21 15:21:19] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:21:19] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p2) p3 (NOT p4))
Support contains 8 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 15:21:19] [INFO ] Invariant cache hit.
[2024-05-21 15:21:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 15:21:20] [INFO ] Invariant cache hit.
[2024-05-21 15:21:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 15:21:20] [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 124 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 105 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 232ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 233ms
Finished structural reductions in LTL mode , in 1 iterations and 284 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) p3 (NOT p4) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0))), (X p3), (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p0))))), (X (NOT p4)), (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0)))), (X (X p3)), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p0)))))), (X (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p4) p0)))), (X (X (AND (NOT p1) p3 (NOT p4) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4) (NOT p0))))), (X (X (AND (NOT p1) (NOT p4) (NOT p0)))), (X (X (AND (NOT p2) p3 (NOT p4)))), (X (X (NOT p0))), (X (X (AND p3 (NOT p4)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 37 factoid took 134 ms. Reduced automaton from 8 states, 21 edges and 5 AP (stutter sensitive) to 8 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
RANDOM walk for 18926 steps (4 resets) in 27 ms. (675 steps per ms) remains 0/23 properties
Knowledge obtained : [(AND (NOT p2) p3 (NOT p4) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0))), (X p3), (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p0))))), (X (NOT p4)), (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0)))), (X (X p3)), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p0)))))), (X (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p4) p0)))), (X (X (AND (NOT p1) p3 (NOT p4) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4) (NOT p0))))), (X (X (AND (NOT p1) (NOT p4) (NOT p0)))), (X (X (AND (NOT p2) p3 (NOT p4)))), (X (X (NOT p0))), (X (X (AND p3 (NOT p4)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p3 p4))), (F (NOT (OR p1 p2 p3 p4 (NOT p0)))), (F (NOT (OR p1 p2 p3 p4 p0))), (F (NOT (OR p1 (NOT p3) p4 (NOT p0)))), (F p4), (F (NOT (OR p1 p2 p4 (NOT p0)))), (F (NOT (AND (OR (NOT p1) p2 p3 p4) (OR p2 p3 p4 p0)))), (F (NOT (OR p1 p2 (NOT p3) p4 (NOT p0)))), (F (NOT (OR p2 p3 p4))), (F (NOT (AND (NOT p1) p3 (NOT p4) (NOT p0)))), (F (NOT (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p0))))), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p4) (NOT p0)))), (F (NOT (AND (NOT p2) p3 (NOT p4)))), (F (NOT p3)), (F (NOT (OR p1 p3 p4 p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0)))), (F (NOT (AND p3 (NOT p4)))), (F (NOT (OR p1 p4 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0)))), (F (NOT (OR p1 p3 p4 (NOT p0)))), (F p1)]
Knowledge based reduction with 37 factoid took 1086 ms. Reduced automaton from 8 states, 21 edges and 5 AP (stutter sensitive) to 8 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
[2024-05-21 15:21:22] [INFO ] Invariant cache hit.
[2024-05-21 15:21:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 15:21:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:21:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 15:21:22] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 15:21:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:21:22] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p2) p3 (NOT p4))
Stuttering acceptance computed with spot in 492 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
Product exploration explored 100000 steps with 4520 reset in 93 ms.
Product exploration explored 100000 steps with 4537 reset in 95 ms.
Applying partial POR strategy [false, true, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
Support contains 8 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 21 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 20 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 20 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 20 transition count 17
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 8 rules in 9 ms. Remains 20 /21 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2024-05-21 15:21:23] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 20 cols
[2024-05-21 15:21:23] [INFO ] Computed 4 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 4 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/37 variables, 0/24 constraints. Problems are: Problem set: 5 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 24 constraints, problems are : Problem set: 5 solved, 11 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 6/20 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 11/35 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/37 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 35 constraints, problems are : Problem set: 5 solved, 11 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 11/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 5 solved, 11 unsolved
Search for dead transitions found 5 dead transitions in 178ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 20/21 places, 12/18 transitions.
Graph (complete) has 20 edges and 20 vertex of which 15 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 15 /20 variables (removed 5) and now considering 12/12 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/21 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 197 ms. Remains : 15/21 places, 12/18 transitions.
Built C files in :
/tmp/ltsmin3520132985206110287
[2024-05-21 15:21:24] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3520132985206110287
Running compilation step : cd /tmp/ltsmin3520132985206110287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin3520132985206110287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3520132985206110287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1770212900077370361.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 15:21:39] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:21:39] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 15:21:39] [INFO ] Invariant cache hit.
[2024-05-21 15:21:39] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 15:21:39] [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 127 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 109 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 239ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 239ms
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin14570233478058773485
[2024-05-21 15:21:39] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14570233478058773485
Running compilation step : cd /tmp/ltsmin14570233478058773485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 93 ms.
Running link step : cd /tmp/ltsmin14570233478058773485;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14570233478058773485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1590893744270252607.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 15:21:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:21:54] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:21:54] [INFO ] Time to serialize gal into /tmp/LTL8394143126460884830.gal : 1 ms
[2024-05-21 15:21:54] [INFO ] Time to serialize properties into /tmp/LTL16486469042623346515.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8394143126460884830.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16725572312165625088.hoa' '-atoms' '/tmp/LTL16486469042623346515.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16486469042623346515.prop.
Loaded 5 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16725572312165625088.hoa
Detected timeout of ITS tools.
[2024-05-21 15:22:09] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:22:09] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:22:09] [INFO ] Time to serialize gal into /tmp/LTL610325749705195312.gal : 1 ms
[2024-05-21 15:22:09] [INFO ] Time to serialize properties into /tmp/LTL6475557622697856194.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL610325749705195312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6475557622697856194.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((((!("(((Uf>=1)&&(MwU>=1))||(MtF>=1))"))U("(MtF>=1)"))U(X(((G(!("((CF<1)||(Si<1))")))||(F("(SpG>=1)")))||("((CG>=1)&&(CwG>=1))")))))
Formula 0 simplified : ("(((Uf>=1)&&(MwU>=1))||(MtF>=1))" R !"(MtF>=1)") R X(!"((CG>=1)&&(CwG>=1))" & F"((CF<1)||(Si<1))" & G!"(SpG>=1)")
Detected timeout of ITS tools.
[2024-05-21 15:22:24] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:22:24] [INFO ] Applying decomposition
[2024-05-21 15:22:24] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17880096880000716441.txt' '-o' '/tmp/graph17880096880000716441.bin' '-w' '/tmp/graph17880096880000716441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17880096880000716441.bin' '-l' '-1' '-v' '-w' '/tmp/graph17880096880000716441.weights' '-q' '0' '-e' '0.001'
[2024-05-21 15:22:24] [INFO ] Decomposing Gal with order
[2024-05-21 15:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:22:24] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 15:22:24] [INFO ] Flatten gal took : 23 ms
[2024-05-21 15:22:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 15:22:24] [INFO ] Time to serialize gal into /tmp/LTL4440169603344147995.gal : 1 ms
[2024-05-21 15:22:24] [INFO ] Time to serialize properties into /tmp/LTL6766363154867272437.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4440169603344147995.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6766363154867272437.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((!("(((u1.Uf>=1)&&(u3.MwU>=1))||(u1.MtF>=1))"))U("(u1.MtF>=1)"))U(X(((G(!("((u4.CF<1)||(u3.Si<1))")))||(F("(u2.SpG>=1)")))||("((u4...182
Formula 0 simplified : ("(((u1.Uf>=1)&&(u3.MwU>=1))||(u1.MtF>=1))" R !"(u1.MtF>=1)") R X(!"((u4.CG>=1)&&(u4.CwG>=1))" & F"((u4.CF<1)||(u3.Si<1))" & G!"(u2....164
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-10 finished in 83055 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(p0)||X(F((p1&&F(p0))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 15:22:39] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:22:39] [INFO ] Implicit Places using invariants in 33 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-11
Product exploration explored 100000 steps with 1948 reset in 85 ms.
Product exploration explored 100000 steps with 1943 reset in 109 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 131 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
RANDOM walk for 20789 steps (8 resets) in 16 ms. (1222 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 11 factoid took 246 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 15:22:41] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:22:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 15:22:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-21 15:22:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:22:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 15:22:41] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-21 15:22:41] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:22:41] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-21 15:22:41] [INFO ] Invariant cache hit.
[2024-05-21 15:22:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 15:22:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 15:22:41] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:22:41] [INFO ] Added : 10 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 18 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 17 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 17 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 14 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 18 place count 12 transition count 9
Applied a total of 18 rules in 1 ms. Remains 12 /21 variables (removed 9) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-21 15:22:41] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:22:41] [INFO ] Implicit Places using invariants in 27 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/21 places, 9/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29 ms. Remains : 11/21 places, 9/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)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
RANDOM walk for 31229 steps (13 resets) in 15 ms. (1951 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 9 rows 11 cols
[2024-05-21 15:22:42] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 15:22:42] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 15:22:42] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-21 15:22:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:22:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 15:22:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 15:22:42] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:22:42] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-21 15:22:42] [INFO ] Invariant cache hit.
[2024-05-21 15:22:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-21 15:22:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 15:22:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:22:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 15:22:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 15:22:42] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 15:22:42] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4496 reset in 70 ms.
Product exploration explored 100000 steps with 4552 reset in 76 ms.
Built C files in :
/tmp/ltsmin7298992834907173997
[2024-05-21 15:22:42] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2024-05-21 15:22:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:22:42] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2024-05-21 15:22:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:22:42] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2024-05-21 15:22:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:22:42] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7298992834907173997
Running compilation step : cd /tmp/ltsmin7298992834907173997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin7298992834907173997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7298992834907173997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4833698255475179087.hoa' '--buchi-type=spotba'
LTSmin run took 200 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-11 finished in 3253 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 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 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 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 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 15 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 19 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 25 place count 10 transition count 7
Applied a total of 25 rules in 2 ms. Remains 10 /24 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-05-21 15:22:43] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 15:22:43] [INFO ] Implicit Places using invariants in 23 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/24 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
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 6 transition count 4
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 5 transition count 4
Applied a total of 6 rules in 2 ms. Remains 5 /8 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-21 15:22:43] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 15:22:43] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-21 15:22:43] [INFO ] Invariant cache hit.
[2024-05-21 15:22:43] [INFO ] Implicit Places using invariants and state equation in 20 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/24 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 41 ms :[p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-12
Product exploration explored 100000 steps with 2 reset in 66 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-12 finished in 183 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((p0 U !p1)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 18 transition count 12
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 14 place count 16 transition count 12
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 18 place count 14 transition count 10
Applied a total of 18 rules in 5 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-21 15:22:43] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:22:43] [INFO ] Implicit Places using invariants in 21 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/24 places, 10/18 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 9
Applied a total of 2 rules in 2 ms. Remains 12 /13 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-21 15:22:43] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 15:22:43] [INFO ] Implicit Places using invariants in 18 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/24 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 49 ms. Remains : 11/24 places, 9/18 transitions.
Stuttering acceptance computed with spot in 76 ms :[p1, true, p1]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-13
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-13 finished in 145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0)&&X(!p1))||X(G(!p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 0 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 15:22:43] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 15:22:43] [INFO ] Implicit Places using invariants in 25 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 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 26 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 155 ms :[p1, p1, (AND p0 p1), true, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-14 finished in 193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U (G(X((X(p2)&&p1))) U p3)))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 15:22:43] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 15:22:43] [INFO ] Implicit Places using invariants in 32 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 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 34 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p3), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), true, (NOT p2), (OR (AND (NOT p1) p2) (AND p1 (NOT p2))), p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1) p2) (AND p0 p1 (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-15 finished in 374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1) U X((p2||G(!p3)||F(p4)))))'
[2024-05-21 15:22:44] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7958895755361033878
[2024-05-21 15:22:44] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-21 15:22:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:22:44] [INFO ] Applying decomposition
[2024-05-21 15:22:44] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-21 15:22:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:22:44] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-21 15:22:44] [INFO ] Flatten gal took : 2 ms
[2024-05-21 15:22:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 15:22:44] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7958895755361033878
Running compilation step : cd /tmp/ltsmin7958895755361033878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5782225714743626299.txt' '-o' '/tmp/graph5782225714743626299.bin' '-w' '/tmp/graph5782225714743626299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5782225714743626299.bin' '-l' '-1' '-v' '-w' '/tmp/graph5782225714743626299.weights' '-q' '0' '-e' '0.001'
[2024-05-21 15:22:44] [INFO ] Decomposing Gal with order
[2024-05-21 15:22:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 15:22:44] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:22:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 15:22:44] [INFO ] Time to serialize gal into /tmp/LTLFireability6294221380120440273.gal : 1 ms
[2024-05-21 15:22:44] [INFO ] Time to serialize properties into /tmp/LTLFireability128705670869799095.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6294221380120440273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability128705670869799095.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((!("(((i0.u0.Uf>=1)&&(i0.u3.MwU>=1))||(i0.u2.MtF>=1))"))U("(i0.u2.MtF>=1)"))U(X((("((i4.u6.CG>=1)&&(i4.u6.CwG>=1))")||(G(!("((u1.C...200
Formula 0 simplified : ("(((i0.u0.Uf>=1)&&(i0.u3.MwU>=1))||(i0.u2.MtF>=1))" R !"(i0.u2.MtF>=1)") R X(!"((i4.u6.CG>=1)&&(i4.u6.CwG>=1))" & F"((u1.CF<1)||(u4...182
Compilation finished in 105 ms.
Running link step : cd /tmp/ltsmin7958895755361033878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin7958895755361033878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((!(LTLAPp0==true) U (LTLAPp1==true)) U X(((LTLAPp2==true)||[](!(LTLAPp3==true))||<>((LTLAPp4==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.041: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.226: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.226: LTL layer: formula: ((!(LTLAPp0==true) U (LTLAPp1==true)) U X(((LTLAPp2==true)||[](!(LTLAPp3==true))||<>((LTLAPp4==true)))))
pins2lts-mc-linux64( 2/ 8), 0.226: "((!(LTLAPp0==true) U (LTLAPp1==true)) U X(((LTLAPp2==true)||[](!(LTLAPp3==true))||<>((LTLAPp4==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.226: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.233: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.232: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.233: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.234: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.233: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.233: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.234: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.243: There are 24 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.243: State length is 25, there are 49 groups
pins2lts-mc-linux64( 0/ 8), 0.243: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.243: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.243: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.243: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.275: [Blue] ~120 levels ~960 states ~3768 transitions
pins2lts-mc-linux64( 7/ 8), 0.286: [Blue] ~240 levels ~1920 states ~4952 transitions
pins2lts-mc-linux64( 7/ 8), 0.307: [Blue] ~362 levels ~3840 states ~7504 transitions
pins2lts-mc-linux64( 7/ 8), 0.347: [Blue] ~362 levels ~7680 states ~14176 transitions
pins2lts-mc-linux64( 4/ 8), 0.396: [Blue] ~357 levels ~15360 states ~37016 transitions
pins2lts-mc-linux64( 4/ 8), 0.477: [Blue] ~357 levels ~30720 states ~75552 transitions
pins2lts-mc-linux64( 3/ 8), 0.664: [Blue] ~358 levels ~61440 states ~149600 transitions
pins2lts-mc-linux64( 5/ 8), 0.917: [Blue] ~348 levels ~122880 states ~328960 transitions
pins2lts-mc-linux64( 5/ 8), 1.325: [Blue] ~348 levels ~245760 states ~668632 transitions
pins2lts-mc-linux64( 5/ 8), 1.927: [Blue] ~348 levels ~491520 states ~1351664 transitions
pins2lts-mc-linux64( 3/ 8), 2.723: [Blue] ~358 levels ~983040 states ~2712168 transitions
pins2lts-mc-linux64( 3/ 8), 3.781: [Blue] ~358 levels ~1966080 states ~5667664 transitions
pins2lts-mc-linux64( 1/ 8), 5.758: [Blue] ~354 levels ~3932160 states ~11651672 transitions
pins2lts-mc-linux64( 1/ 8), 9.505: [Blue] ~354 levels ~7864320 states ~23477544 transitions
pins2lts-mc-linux64( 1/ 8), 17.300: [Blue] ~354 levels ~15728640 states ~47130312 transitions
pins2lts-mc-linux64( 1/ 8), 33.874: [Blue] ~354 levels ~31457280 states ~94747352 transitions
pins2lts-mc-linux64( 3/ 8), 47.849: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 47.867:
pins2lts-mc-linux64( 0/ 8), 47.867: Explored 37982962 states 123732358 transitions, fanout: 3.258
pins2lts-mc-linux64( 0/ 8), 47.867: Total exploration time 47.600 sec (47.570 sec minimum, 47.587 sec on average)
pins2lts-mc-linux64( 0/ 8), 47.867: States per second: 797961, Transitions per second: 2599420
pins2lts-mc-linux64( 0/ 8), 47.867:
pins2lts-mc-linux64( 0/ 8), 47.867: State space has 32767656 states, 23749725 are accepting
pins2lts-mc-linux64( 0/ 8), 47.867: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 47.867: blue states: 37982962 (115.92%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 47.867: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 47.867: all-red states: 23750702 (72.48%), bogus 3545068 (10.82%)
pins2lts-mc-linux64( 0/ 8), 47.867:
pins2lts-mc-linux64( 0/ 8), 47.867: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 47.867:
pins2lts-mc-linux64( 0/ 8), 47.867: Queue width: 8B, total height: 2851, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 47.867: Tree memory: 506.0MB, 16.2 B/state, compr.: 15.9%
pins2lts-mc-linux64( 0/ 8), 47.867: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 47.867: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 47.867: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 47.867: Est. total memory use: 506.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7958895755361033878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((!(LTLAPp0==true) U (LTLAPp1==true)) U X(((LTLAPp2==true)||[](!(LTLAPp3==true))||<>((LTLAPp4==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7958895755361033878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((!(LTLAPp0==true) U (LTLAPp1==true)) U X(((LTLAPp2==true)||[](!(LTLAPp3==true))||<>((LTLAPp4==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-21 15:43:16] [INFO ] Flatten gal took : 3 ms
[2024-05-21 15:43:16] [INFO ] Time to serialize gal into /tmp/LTLFireability14505170972804138701.gal : 1 ms
[2024-05-21 15:43:16] [INFO ] Time to serialize properties into /tmp/LTLFireability8867181839170351665.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14505170972804138701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8867181839170351665.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((((!("(((Uf>=1)&&(MwU>=1))||(MtF>=1))"))U("(MtF>=1)"))U(X((("((CG>=1)&&(CwG>=1))")||(G(!("((CF<1)||(Si<1))"))))||(F("(SpG>=1)"))))))
Formula 0 simplified : ("(((Uf>=1)&&(MwU>=1))||(MtF>=1))" R !"(MtF>=1)") R X(!"((CG>=1)&&(CwG>=1))" & F"((CF<1)||(Si<1))" & G!"(SpG>=1)")
Detected timeout of ITS tools.
[2024-05-21 16:03:48] [INFO ] Flatten gal took : 2 ms
[2024-05-21 16:03:48] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-21 16:03:48] [INFO ] Transformed 24 places.
[2024-05-21 16:03:48] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 16:03:48] [INFO ] Time to serialize gal into /tmp/LTLFireability13500401730771197856.gal : 1 ms
[2024-05-21 16:03:48] [INFO ] Time to serialize properties into /tmp/LTLFireability9807765423801373328.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13500401730771197856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9807765423801373328.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((!("(((Uf>=1)&&(MwU>=1))||(MtF>=1))"))U("(MtF>=1)"))U(X((("((CG>=1)&&(CwG>=1))")||(G(!("((CF<1)||(Si<1))"))))||(F("(SpG>=1)"))))))
Formula 0 simplified : ("(((Uf>=1)&&(MwU>=1))||(MtF>=1))" R !"(MtF>=1)") R X(!"((CG>=1)&&(CwG>=1))" & F"((CF<1)||(Si<1))" & G!"(SpG>=1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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