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.r422-smll-171690573500068.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 TCPcondis-PT-50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r422-smll-171690573500068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 03:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 03:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 24K May 18 16:43 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 TCPcondis-PT-50-LTLFireability-00
FORMULA_NAME TCPcondis-PT-50-LTLFireability-01
FORMULA_NAME TCPcondis-PT-50-LTLFireability-02
FORMULA_NAME TCPcondis-PT-50-LTLFireability-03
FORMULA_NAME TCPcondis-PT-50-LTLFireability-04
FORMULA_NAME TCPcondis-PT-50-LTLFireability-05
FORMULA_NAME TCPcondis-PT-50-LTLFireability-06
FORMULA_NAME TCPcondis-PT-50-LTLFireability-07
FORMULA_NAME TCPcondis-PT-50-LTLFireability-08
FORMULA_NAME TCPcondis-PT-50-LTLFireability-09
FORMULA_NAME TCPcondis-PT-50-LTLFireability-10
FORMULA_NAME TCPcondis-PT-50-LTLFireability-11
FORMULA_NAME TCPcondis-PT-50-LTLFireability-12
FORMULA_NAME TCPcondis-PT-50-LTLFireability-13
FORMULA_NAME TCPcondis-PT-50-LTLFireability-14
FORMULA_NAME TCPcondis-PT-50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716981865274

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 11:24:27] [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-29 11:24:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:24:27] [WARNING] Skipping unknown tool specific annotation : Tina
[2024-05-29 11:24:27] [WARNING] Unknown XML tag in source file: size
[2024-05-29 11:24:27] [WARNING] Unknown XML tag in source file: color
[2024-05-29 11:24:27] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-29 11:24:27] [INFO ] Transformed 30 places.
[2024-05-29 11:24:27] [INFO ] Transformed 32 transitions.
[2024-05-29 11:24:27] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA TCPcondis-PT-50-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-50-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-50-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-50-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-50-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 15 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:24:28] [INFO ] Computed 9 invariants in 13 ms
[2024-05-29 11:24:28] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-29 11:24:28] [INFO ] Invariant cache hit.
[2024-05-29 11:24:28] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-29 11:24:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1638ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1659ms
Finished structural reductions in LTL mode , in 1 iterations and 2167 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 20 out of 30 places after structural reductions.
[2024-05-29 11:24:30] [INFO ] Flatten gal took : 27 ms
[2024-05-29 11:24:30] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:24:30] [INFO ] Input system was already deterministic with 32 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 20367 steps (3 resets) in 185 ms. (109 steps per ms) remains 0/17 properties
FORMULA TCPcondis-PT-50-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA TCPcondis-PT-50-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(((p0&&X(G((p0||X(G(p1)))))) U G(p2)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:24:31] [INFO ] Invariant cache hit.
[2024-05-29 11:24:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 11:24:31] [INFO ] Invariant cache hit.
[2024-05-29 11:24:31] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-29 11:24:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1582ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1584ms
Finished structural reductions in LTL mode , in 1 iterations and 1770 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 530 ms :[(NOT p2), true, (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-01
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 3 ms.
FORMULA TCPcondis-PT-50-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-01 finished in 2423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X(p1)||p0)))))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:24:33] [INFO ] Invariant cache hit.
[2024-05-29 11:24:33] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 11:24:33] [INFO ] Invariant cache hit.
[2024-05-29 11:24:33] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-29 11:24:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 734 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1382ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1383ms
Finished structural reductions in LTL mode , in 1 iterations and 1505 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-03
Entered a terminal (fully accepting) state of product in 104 steps with 0 reset in 2 ms.
FORMULA TCPcondis-PT-50-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-03 finished in 1782 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||G(p1)||G(p2)))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:24:35] [INFO ] Invariant cache hit.
[2024-05-29 11:24:35] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 11:24:35] [INFO ] Invariant cache hit.
[2024-05-29 11:24:35] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-29 11:24:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1286ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1287ms
Finished structural reductions in LTL mode , in 1 iterations and 1386 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-04
Product exploration explored 100000 steps with 15440 reset in 494 ms.
Product exploration explored 100000 steps with 15471 reset in 262 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 438 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false]
RANDOM walk for 40066 steps (8 resets) in 161 ms. (247 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 1/2 properties
BEST_FIRST walk for 11588 steps (3 resets) in 42 ms. (269 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 13 factoid took 957 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false]
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 25 transition count 25
Applied a total of 12 rules in 29 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-29 11:24:40] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 11:24:40] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 11:24:40] [INFO ] Invariant cache hit.
[2024-05-29 11:24:40] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-29 11:24:40] [INFO ] Redundant transitions in 1 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-29 11:24:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 560ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 561ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 702 ms. Remains : 25/30 places, 25/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 20 factoid took 384 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false]
RANDOM walk for 40061 steps (8 resets) in 58 ms. (679 steps per ms) remains 1/11 properties
BEST_FIRST walk for 1742 steps (0 resets) in 9 ms. (174 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 20 factoid took 947 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false]
Stuttering acceptance computed with spot in 449 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false]
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false]
Product exploration explored 100000 steps with 19452 reset in 297 ms.
Stack based approach found an accepted trace after 32583 steps with 6393 reset with depth 16 and stack size 16 in 212 ms.
FORMULA TCPcondis-PT-50-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-04 finished in 8959 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((X(p1)||p0))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:24:44] [INFO ] Computed 9 invariants in 3 ms
[2024-05-29 11:24:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-29 11:24:44] [INFO ] Invariant cache hit.
[2024-05-29 11:24:44] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-29 11:24:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1398ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1400ms
Finished structural reductions in LTL mode , in 1 iterations and 1543 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-08
Product exploration explored 100000 steps with 14249 reset in 209 ms.
Product exploration explored 100000 steps with 14184 reset in 215 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 p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 514 steps (0 resets) in 5 ms. (85 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 333 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 11:24:47] [INFO ] Invariant cache hit.
[2024-05-29 11:24:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 11:24:47] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-29 11:24:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-29 11:24:47] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 11:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:24:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-29 11:24:47] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-29 11:24:47] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-29 11:24:47] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 11:24:47] [INFO ] Added : 27 causal constraints over 6 iterations in 69 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:24:47] [INFO ] Invariant cache hit.
[2024-05-29 11:24:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 11:24:47] [INFO ] Invariant cache hit.
[2024-05-29 11:24:47] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-29 11:24:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1423ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1425ms
Finished structural reductions in LTL mode , in 1 iterations and 1568 ms. Remains : 30/30 places, 32/32 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 (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 218 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1279 steps (0 resets) in 5 ms. (213 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 267 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 11:24:50] [INFO ] Invariant cache hit.
[2024-05-29 11:24:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 11:24:50] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 8 ms returned sat
[2024-05-29 11:24:50] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-29 11:24:50] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-29 11:24:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:24:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-29 11:24:50] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-29 11:24:50] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-29 11:24:50] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 11:24:50] [INFO ] Added : 27 causal constraints over 6 iterations in 57 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14219 reset in 191 ms.
Product exploration explored 100000 steps with 14168 reset in 214 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:24:51] [INFO ] Redundant transitions in 1 ms returned []
Running 28 sub problems to find dead transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:24:51] [INFO ] Computed 9 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD15 is UNSAT
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 3 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 3 solved, 25 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 3/28 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 2/9 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 25/64 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 64 constraints, problems are : Problem set: 3 solved, 25 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 25/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1411ms problems are : Problem set: 3 solved, 25 unsolved
Search for dead transitions found 3 dead transitions in 1413ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 29/32 transitions.
Graph (complete) has 72 edges and 30 vertex of which 27 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 27 /30 variables (removed 3) and now considering 29/29 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/30 places, 29/32 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1440 ms. Remains : 27/30 places, 29/32 transitions.
Built C files in :
/tmp/ltsmin6877093504447592275
[2024-05-29 11:24:52] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6877093504447592275
Running compilation step : cd /tmp/ltsmin6877093504447592275;'/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 681 ms.
Running link step : cd /tmp/ltsmin6877093504447592275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin6877093504447592275;'/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/stateBased6902662208042212152.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 11:25:07] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:25:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 11:25:07] [INFO ] Invariant cache hit.
[2024-05-29 11:25:08] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-29 11:25:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1227ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1228ms
Finished structural reductions in LTL mode , in 1 iterations and 1328 ms. Remains : 30/30 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin6022234950226015020
[2024-05-29 11:25:09] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6022234950226015020
Running compilation step : cd /tmp/ltsmin6022234950226015020;'/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 263 ms.
Running link step : cd /tmp/ltsmin6022234950226015020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin6022234950226015020;'/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/stateBased13859056600147122160.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 11:25:24] [INFO ] Flatten gal took : 7 ms
[2024-05-29 11:25:24] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:25:24] [INFO ] Time to serialize gal into /tmp/LTL12862336464307549134.gal : 3 ms
[2024-05-29 11:25:24] [INFO ] Time to serialize properties into /tmp/LTL11218638413810737876.prop : 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/LTL12862336464307549134.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1601066378599138293.hoa' '-atoms' '/tmp/LTL11218638413810737876.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/LTL11218638413810737876.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1601066378599138293.hoa
Detected timeout of ITS tools.
[2024-05-29 11:25:39] [INFO ] Flatten gal took : 5 ms
[2024-05-29 11:25:39] [INFO ] Flatten gal took : 9 ms
[2024-05-29 11:25:39] [INFO ] Time to serialize gal into /tmp/LTL7902938600122693084.gal : 8 ms
[2024-05-29 11:25:39] [INFO ] Time to serialize properties into /tmp/LTL12531186888255436540.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/LTL7902938600122693084.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12531186888255436540.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...276
Read 1 LTL properties
Checking formula 0 : !((X(F(((X("((xCLOSED<1)||((SYNACK>=1)&&(xSYNRCVD>=1)))"))||("((CLOSING>=1)&&(xFINACK>=1))"))||("(((SYNACK>=1)&&(xSYNRCVD>=1))||((LIST...180
Formula 0 simplified : XG(!"(((SYNACK>=1)&&(xSYNRCVD>=1))||((LISTEN>=1)&&(xSYN>=1)))" & !"((CLOSING>=1)&&(xFINACK>=1))" & X!"((xCLOSED<1)||((SYNACK>=1)&&(x...170
Detected timeout of ITS tools.
[2024-05-29 11:25:54] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:25:54] [INFO ] Applying decomposition
[2024-05-29 11:25:54] [INFO ] Flatten gal took : 4 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/graph14874539546599022573.txt' '-o' '/tmp/graph14874539546599022573.bin' '-w' '/tmp/graph14874539546599022573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14874539546599022573.bin' '-l' '-1' '-v' '-w' '/tmp/graph14874539546599022573.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:25:54] [INFO ] Decomposing Gal with order
[2024-05-29 11:25:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:25:54] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-29 11:25:54] [INFO ] Flatten gal took : 43 ms
[2024-05-29 11:25:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 11:25:54] [INFO ] Time to serialize gal into /tmp/LTL2429836680485675553.gal : 3 ms
[2024-05-29 11:25:54] [INFO ] Time to serialize properties into /tmp/LTL17757163218813448497.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/LTL2429836680485675553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17757163218813448497.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...255
Read 1 LTL properties
Checking formula 0 : !((X(F(((X("((u5.xCLOSED<1)||((i3.i0.u6.SYNACK>=1)&&(i3.i0.u6.xSYNRCVD>=1)))"))||("((u0.CLOSING>=1)&&(i2.u7.xFINACK>=1))"))||("(((i3.i...234
Formula 0 simplified : XG(!"(((i3.i0.u6.SYNACK>=1)&&(i3.i0.u6.xSYNRCVD>=1))||((u0.LISTEN>=1)&&(u5.xSYN>=1)))" & !"((u0.CLOSING>=1)&&(i2.u7.xFINACK>=1))" & ...224
Detected timeout of ITS tools.
Treatment of property TCPcondis-PT-50-LTLFireability-08 finished in 85760 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||G(p1)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 11:26:09] [INFO ] Invariant cache hit.
[2024-05-29 11:26:09] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 11:26:09] [INFO ] Invariant cache hit.
[2024-05-29 11:26:09] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-29 11:26:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1276ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1277ms
Finished structural reductions in LTL mode , in 1 iterations and 1425 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-09
Product exploration explored 100000 steps with 15516 reset in 146 ms.
Product exploration explored 100000 steps with 15480 reset in 199 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40050 steps (8 resets) in 41 ms. (953 steps per ms) remains 1/6 properties
BEST_FIRST walk for 1109 steps (0 resets) in 6 ms. (158 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 531 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-29 11:26:13] [INFO ] Invariant cache hit.
[2024-05-29 11:26:13] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-29 11:26:13] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-29 11:26:13] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-29 11:26:13] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 11:26:13] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 11 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-29 11:26:13] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:26:13] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 11:26:13] [INFO ] Invariant cache hit.
[2024-05-29 11:26:13] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-29 11:26:13] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-05-29 11:26:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/46 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 32 constraints, problems are : Problem set: 0 solved, 21 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/46 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 53 constraints, problems are : Problem set: 0 solved, 21 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 735ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 736ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 884 ms. Remains : 23/30 places, 23/32 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 p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 355 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40181 steps (8 resets) in 25 ms. (1545 steps per ms) remains 1/6 properties
BEST_FIRST walk for 408 steps (0 resets) in 4 ms. (81 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 613 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-29 11:26:15] [INFO ] Invariant cache hit.
[2024-05-29 11:26:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 11:26:15] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-29 11:26:15] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-29 11:26:15] [INFO ] Computed and/alt/rep : 21/75/21 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 11:26:15] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 19481 reset in 208 ms.
Stack based approach found an accepted trace after 91 steps with 19 reset with depth 11 and stack size 11 in 0 ms.
FORMULA TCPcondis-PT-50-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-09 finished in 6469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 15 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2024-05-29 11:26:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:26:16] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 11:26:16] [INFO ] Invariant cache hit.
[2024-05-29 11:26:16] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-29 11:26:16] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-29 11:26:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 22/44 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/44 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 31 constraints, problems are : Problem set: 0 solved, 20 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 22/44 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 698ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 699ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 849 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-11
Product exploration explored 100000 steps with 3411 reset in 382 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA TCPcondis-PT-50-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-11 finished in 1357 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 (F(G(p0))||G(!p0))))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
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 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 26 transition count 25
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 12 place count 25 transition count 25
Applied a total of 12 rules in 10 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-29 11:26:17] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:26:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 11:26:17] [INFO ] Invariant cache hit.
[2024-05-29 11:26:17] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-29 11:26:17] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-29 11:26:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 980ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 981ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1143 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 139 ms :[false, false, (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 331 ms.
Product exploration explored 100000 steps with 0 reset in 443 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter insensitive) to 3 states, 6 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[false, false, (NOT p0)]
RANDOM walk for 255 steps (0 resets) in 4 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter insensitive) to 3 states, 6 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[false, false, (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[false, false, (NOT p0)]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-29 11:26:20] [INFO ] Invariant cache hit.
[2024-05-29 11:26:20] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 11:26:20] [INFO ] Invariant cache hit.
[2024-05-29 11:26:20] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-29 11:26:20] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-29 11:26:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 1013ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 1014ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1159 ms. Remains : 25/25 places, 25/25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter insensitive) to 3 states, 6 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[false, false, (NOT p0)]
RANDOM walk for 306 steps (0 resets) in 4 ms. (61 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter insensitive) to 3 states, 6 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[false, false, (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[false, false, (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[false, false, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 325 ms.
Product exploration explored 100000 steps with 0 reset in 695 ms.
Built C files in :
/tmp/ltsmin11904854531532176068
[2024-05-29 11:26:23] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2024-05-29 11:26:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:26:23] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2024-05-29 11:26:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:26:23] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2024-05-29 11:26:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:26:23] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11904854531532176068
Running compilation step : cd /tmp/ltsmin11904854531532176068;'/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 160 ms.
Running link step : cd /tmp/ltsmin11904854531532176068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11904854531532176068;'/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/stateBased10071690089287591541.hoa' '--buchi-type=spotba'
LTSmin run took 460 ms.
FORMULA TCPcondis-PT-50-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-50-LTLFireability-12 finished in 6505 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)||G(p1)||G((!p2 U p3)))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 27 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 27
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 9 place count 26 transition count 27
Applied a total of 9 rules in 7 ms. Remains 26 /30 variables (removed 4) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 26 cols
[2024-05-29 11:26:24] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:26:24] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 11:26:24] [INFO ] Invariant cache hit.
[2024-05-29 11:26:24] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-29 11:26:24] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-29 11:26:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 27/53 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 35 constraints, problems are : Problem set: 0 solved, 24 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 27/53 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 59 constraints, problems are : Problem set: 0 solved, 24 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 888ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 889ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 27/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 984 ms. Remains : 26/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-14
Product exploration explored 100000 steps with 99 reset in 817 ms.
Product exploration explored 100000 steps with 105 reset in 594 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X p2), (X p3), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 119 ms. Reduced automaton from 2 states, 20 edges and 4 AP (stutter insensitive) to 2 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 40131 steps (8 resets) in 39 ms. (1003 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 1/2 properties
BEST_FIRST walk for 3310 steps (0 resets) in 6 ms. (472 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X p2), (X p3), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p3 p2))), (F (NOT (AND (OR (NOT p0) p1 (NOT p3)) (OR (NOT p0) p1 p2)))), (F (NOT (OR p0 (NOT p1) p3 p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F p0), (F (NOT (OR p0 (NOT p1) p3 (NOT p2)))), (F (NOT (AND (OR p0 p1 (NOT p3)) (OR p0 p1 p2)))), (F (NOT (AND (OR (NOT p0) (NOT p1) (NOT p3)) (OR (NOT p0) (NOT p1) p2)))), (F (NOT (OR p0 p1 p3 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p3 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) p3 (NOT p2)))), (F (NOT p3)), (F (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))))), (F (NOT (OR (NOT p0) p1 p3 p2)))]
Knowledge based reduction with 33 factoid took 838 ms. Reduced automaton from 2 states, 20 edges and 4 AP (stutter insensitive) to 2 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 7 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-05-29 11:26:28] [INFO ] Invariant cache hit.
[2024-05-29 11:26:28] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 11:26:28] [INFO ] Invariant cache hit.
[2024-05-29 11:26:28] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-29 11:26:28] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-29 11:26:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 27/53 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 35 constraints, problems are : Problem set: 0 solved, 24 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 27/53 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 59 constraints, problems are : Problem set: 0 solved, 24 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 952ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 954ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1067 ms. Remains : 26/26 places, 27/27 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X p2), (X p3), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 150 ms. Reduced automaton from 2 states, 20 edges and 4 AP (stutter insensitive) to 2 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 35420 steps (7 resets) in 44 ms. (787 steps per ms) remains 0/16 properties
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X p2), (X p3), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2))))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT p0)), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p3 p2))), (F (NOT (AND (OR (NOT p0) p1 (NOT p3)) (OR (NOT p0) p1 p2)))), (F (NOT (OR p0 (NOT p1) p3 p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F p0), (F (NOT (OR p0 (NOT p1) p3 (NOT p2)))), (F (NOT (AND (OR p0 p1 (NOT p3)) (OR p0 p1 p2)))), (F (NOT (AND (OR (NOT p0) (NOT p1) (NOT p3)) (OR (NOT p0) (NOT p1) p2)))), (F (NOT (OR p0 p1 p3 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p3 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1) p3 (NOT p2)))), (F (NOT p3)), (F (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))))), (F (NOT (OR (NOT p0) p1 p3 p2)))]
Knowledge based reduction with 33 factoid took 876 ms. Reduced automaton from 2 states, 20 edges and 4 AP (stutter insensitive) to 2 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 100 reset in 990 ms.
Product exploration explored 100000 steps with 98 reset in 630 ms.
Built C files in :
/tmp/ltsmin7325152463477262979
[2024-05-29 11:26:32] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2024-05-29 11:26:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:26:32] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2024-05-29 11:26:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:26:32] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2024-05-29 11:26:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:26:32] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7325152463477262979
Running compilation step : cd /tmp/ltsmin7325152463477262979;'/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 155 ms.
Running link step : cd /tmp/ltsmin7325152463477262979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7325152463477262979;'/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/stateBased17628355203786937593.hoa' '--buchi-type=spotba'
LTSmin run took 378 ms.
FORMULA TCPcondis-PT-50-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-50-LTLFireability-14 finished in 8832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 13 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-29 11:26:33] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:26:33] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 11:26:33] [INFO ] Invariant cache hit.
[2024-05-29 11:26:33] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-29 11:26:33] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-05-29 11:26:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/46 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 32 constraints, problems are : Problem set: 0 solved, 21 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/46 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 53 constraints, problems are : Problem set: 0 solved, 21 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 653ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 654ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 776 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-15
Product exploration explored 100000 steps with 1908 reset in 284 ms.
Stack based approach found an accepted trace after 7283 steps with 132 reset with depth 19 and stack size 19 in 23 ms.
FORMULA TCPcondis-PT-50-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-15 finished in 1200 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((X(p1)||p0))))'
Found a Shortening insensitive property : TCPcondis-PT-50-LTLFireability-08
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
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 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Applied a total of 6 rules in 8 ms. Remains 27 /30 variables (removed 3) and now considering 29/32 (removed 3) transitions.
// Phase 1: matrix 29 rows 27 cols
[2024-05-29 11:26:34] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 11:26:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 11:26:34] [INFO ] Invariant cache hit.
[2024-05-29 11:26:34] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 25 sub problems to find dead transitions.
[2024-05-29 11:26:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 29/56 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 36 constraints, problems are : Problem set: 0 solved, 25 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 29/56 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 61 constraints, problems are : Problem set: 0 solved, 25 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 1032ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 1033ms
Starting structural reductions in LI_LTL mode, iteration 1 : 27/30 places, 29/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1172 ms. Remains : 27/30 places, 29/32 transitions.
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-08
Product exploration explored 100000 steps with 14170 reset in 456 ms.
Product exploration explored 100000 steps with 14252 reset in 261 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 p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 819 steps (0 resets) in 4 ms. (163 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 11:26:37] [INFO ] Invariant cache hit.
[2024-05-29 11:26:37] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-29 11:26:37] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-29 11:26:37] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-29 11:26:37] [INFO ] Computed and/alt/rep : 25/96/25 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 11:26:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:26:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-29 11:26:37] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-29 11:26:37] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-29 11:26:37] [INFO ] Computed and/alt/rep : 25/96/25 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 11:26:37] [INFO ] Added : 16 causal constraints over 4 iterations in 44 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2024-05-29 11:26:37] [INFO ] Invariant cache hit.
[2024-05-29 11:26:37] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 11:26:37] [INFO ] Invariant cache hit.
[2024-05-29 11:26:37] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 25 sub problems to find dead transitions.
[2024-05-29 11:26:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 29/56 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 36 constraints, problems are : Problem set: 0 solved, 25 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 29/56 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 61 constraints, problems are : Problem set: 0 solved, 25 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 1094ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 1095ms
Finished structural reductions in LTL mode , in 1 iterations and 1226 ms. Remains : 27/27 places, 29/29 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 (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 616 steps (0 resets) in 5 ms. (102 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 316 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 11:26:39] [INFO ] Invariant cache hit.
[2024-05-29 11:26:39] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-29 11:26:39] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-29 11:26:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-29 11:26:39] [INFO ] Computed and/alt/rep : 25/96/25 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 11:26:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:26:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-29 11:26:40] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-29 11:26:40] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-29 11:26:40] [INFO ] Computed and/alt/rep : 25/96/25 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 11:26:40] [INFO ] Added : 16 causal constraints over 4 iterations in 48 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14189 reset in 196 ms.
Product exploration explored 100000 steps with 14110 reset in 213 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2024-05-29 11:26:40] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-29 11:26:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 29/56 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 36 constraints, problems are : Problem set: 0 solved, 25 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 29/56 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 61 constraints, problems are : Problem set: 0 solved, 25 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 1104ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 1105ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1116 ms. Remains : 27/27 places, 29/29 transitions.
Built C files in :
/tmp/ltsmin6316132138655772600
[2024-05-29 11:26:42] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6316132138655772600
Running compilation step : cd /tmp/ltsmin6316132138655772600;'/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 259 ms.
Running link step : cd /tmp/ltsmin6316132138655772600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6316132138655772600;'/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/stateBased1048037485344997145.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2024-05-29 11:26:57] [INFO ] Invariant cache hit.
[2024-05-29 11:26:57] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 11:26:57] [INFO ] Invariant cache hit.
[2024-05-29 11:26:57] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 25 sub problems to find dead transitions.
[2024-05-29 11:26:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 29/56 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 36 constraints, problems are : Problem set: 0 solved, 25 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 29/56 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 61 constraints, problems are : Problem set: 0 solved, 25 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 961ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 961ms
Finished structural reductions in LTL mode , in 1 iterations and 1069 ms. Remains : 27/27 places, 29/29 transitions.
Built C files in :
/tmp/ltsmin2250415015401126571
[2024-05-29 11:26:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2250415015401126571
Running compilation step : cd /tmp/ltsmin2250415015401126571;'/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 236 ms.
Running link step : cd /tmp/ltsmin2250415015401126571;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin2250415015401126571;'/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/stateBased15569603398720225653.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 11:27:13] [INFO ] Flatten gal took : 7 ms
[2024-05-29 11:27:13] [INFO ] Flatten gal took : 5 ms
[2024-05-29 11:27:13] [INFO ] Time to serialize gal into /tmp/LTL4791775632622176500.gal : 3 ms
[2024-05-29 11:27:13] [INFO ] Time to serialize properties into /tmp/LTL16001873917646152006.prop : 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/LTL4791775632622176500.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17703503440909892941.hoa' '-atoms' '/tmp/LTL16001873917646152006.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/LTL16001873917646152006.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17703503440909892941.hoa
Detected timeout of ITS tools.
[2024-05-29 11:27:28] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:27:28] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:27:28] [INFO ] Time to serialize gal into /tmp/LTL15548068102932058912.gal : 2 ms
[2024-05-29 11:27:28] [INFO ] Time to serialize properties into /tmp/LTL12533197993960026813.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/LTL15548068102932058912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12533197993960026813.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...277
Read 1 LTL properties
Checking formula 0 : !((X(F(((X("((xCLOSED<1)||((SYNACK>=1)&&(xSYNRCVD>=1)))"))||("((CLOSING>=1)&&(xFINACK>=1))"))||("(((SYNACK>=1)&&(xSYNRCVD>=1))||((LIST...180
Formula 0 simplified : XG(!"(((SYNACK>=1)&&(xSYNRCVD>=1))||((LISTEN>=1)&&(xSYN>=1)))" & !"((CLOSING>=1)&&(xFINACK>=1))" & X!"((xCLOSED<1)||((SYNACK>=1)&&(x...170
Detected timeout of ITS tools.
[2024-05-29 11:27:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 11:27:43] [INFO ] Applying decomposition
[2024-05-29 11:27:43] [INFO ] Flatten gal took : 5 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/graph4285234117946925628.txt' '-o' '/tmp/graph4285234117946925628.bin' '-w' '/tmp/graph4285234117946925628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4285234117946925628.bin' '-l' '-1' '-v' '-w' '/tmp/graph4285234117946925628.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:27:43] [INFO ] Decomposing Gal with order
[2024-05-29 11:27:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:27:43] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-29 11:27:43] [INFO ] Flatten gal took : 11 ms
[2024-05-29 11:27:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-29 11:27:43] [INFO ] Time to serialize gal into /tmp/LTL963235341443364069.gal : 2 ms
[2024-05-29 11:27:43] [INFO ] Time to serialize properties into /tmp/LTL1323804858276600476.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/LTL963235341443364069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1323804858276600476.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...253
Read 1 LTL properties
Checking formula 0 : !((X(F(((X("((u7.xCLOSED<1)||((i2.u4.SYNACK>=1)&&(i2.u4.xSYNRCVD>=1)))"))||("((u0.CLOSING>=1)&&(i1.u2.xFINACK>=1))"))||("(((i2.u4.SYNA...222
Formula 0 simplified : XG(!"(((i2.u4.SYNACK>=1)&&(i2.u4.xSYNRCVD>=1))||((u0.LISTEN>=1)&&(u7.xSYN>=1)))" & !"((u0.CLOSING>=1)&&(i1.u2.xFINACK>=1))" & X!"((u...212
Detected timeout of ITS tools.
Treatment of property TCPcondis-PT-50-LTLFireability-08 finished in 84485 ms.
[2024-05-29 11:27:58] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17661931984650930364
[2024-05-29 11:27:58] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2024-05-29 11:27:58] [INFO ] Applying decomposition
[2024-05-29 11:27:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:27:58] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2024-05-29 11:27:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:27:58] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:27:58] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2024-05-29 11:27:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:27:58] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17661931984650930364
Running compilation step : cd /tmp/ltsmin17661931984650930364;'/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/graph2071473965315294284.txt' '-o' '/tmp/graph2071473965315294284.bin' '-w' '/tmp/graph2071473965315294284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2071473965315294284.bin' '-l' '-1' '-v' '-w' '/tmp/graph2071473965315294284.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:27:58] [INFO ] Decomposing Gal with order
[2024-05-29 11:27:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:27:58] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-29 11:27:58] [INFO ] Flatten gal took : 7 ms
[2024-05-29 11:27:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 11:27:58] [INFO ] Time to serialize gal into /tmp/LTLFireability9532265139513500597.gal : 5 ms
[2024-05-29 11:27:58] [INFO ] Time to serialize properties into /tmp/LTLFireability13486385570010081704.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/LTLFireability9532265139513500597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13486385570010081704.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...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((u4.CLOSING>=1)&&(i0.i0.u6.xFINACK>=1))||((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1)))")||(("((u4.LISTEN>=1)&&(u9.xSYN>=1...237
Formula 0 simplified : XG(!"(((u4.CLOSING>=1)&&(i0.i0.u6.xFINACK>=1))||((i2.i0.u5.SYNACK>=1)&&(i2.i0.u5.xSYNRCVD>=1)))" & !"((u4.LISTEN>=1)&&(u9.xSYN>=1))"...227
Compilation finished in 209 ms.
Running link step : cd /tmp/ltsmin17661931984650930364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17661931984650930364;'/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' 'X(<>((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 11:49:09] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:49:09] [INFO ] Time to serialize gal into /tmp/LTLFireability7453698964417315142.gal : 1 ms
[2024-05-29 11:49:09] [INFO ] Time to serialize properties into /tmp/LTLFireability3607509733573763598.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/LTLFireability7453698964417315142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3607509733573763598.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...297
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((CLOSING>=1)&&(xFINACK>=1))||((SYNACK>=1)&&(xSYNRCVD>=1)))")||(("((LISTEN>=1)&&(xSYN>=1))")||(X("((xCLOSED<1)||((SYNACK>=1)...180
Formula 0 simplified : XG(!"(((CLOSING>=1)&&(xFINACK>=1))||((SYNACK>=1)&&(xSYNRCVD>=1)))" & !"((LISTEN>=1)&&(xSYN>=1))" & X!"((xCLOSED<1)||((SYNACK>=1)&&(x...170
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
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.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: LTL layer: formula: X(<>((X((LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: "X(<>((X((LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.039: DFS-FIFO for weak LTL, using special progress label 35
pins2lts-mc-linux64( 0/ 8), 0.039: There are 36 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.039: State length is 31, there are 35 groups
pins2lts-mc-linux64( 0/ 8), 0.039: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.039: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.039: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.039: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.138: ~82 levels ~960 states ~5040 transitions
pins2lts-mc-linux64( 4/ 8), 0.186: ~137 levels ~1920 states ~8160 transitions
pins2lts-mc-linux64( 4/ 8), 0.208: ~159 levels ~3840 states ~10704 transitions
pins2lts-mc-linux64( 4/ 8), 0.256: ~159 levels ~7680 states ~14704 transitions
pins2lts-mc-linux64( 4/ 8), 0.332: ~159 levels ~15360 states ~22912 transitions
pins2lts-mc-linux64( 4/ 8), 0.423: ~159 levels ~30720 states ~48656 transitions
pins2lts-mc-linux64( 4/ 8), 0.801: ~159 levels ~61440 states ~104704 transitions
pins2lts-mc-linux64( 4/ 8), 1.272: ~159 levels ~122880 states ~225768 transitions
pins2lts-mc-linux64( 4/ 8), 2.131: ~159 levels ~245760 states ~476736 transitions
pins2lts-mc-linux64( 4/ 8), 3.600: ~159 levels ~491520 states ~987496 transitions
pins2lts-mc-linux64( 4/ 8), 6.151: ~159 levels ~983040 states ~2026856 transitions
pins2lts-mc-linux64( 4/ 8), 9.997: ~159 levels ~1966080 states ~4125448 transitions
pins2lts-mc-linux64( 4/ 8), 15.573: ~159 levels ~3932160 states ~8379960 transitions
pins2lts-mc-linux64( 4/ 8), 23.187: ~159 levels ~7864320 states ~16883840 transitions
pins2lts-mc-linux64( 4/ 8), 34.296: ~159 levels ~15728640 states ~34055376 transitions
pins2lts-mc-linux64( 4/ 8), 56.083: ~172 levels ~31457280 states ~66706528 transitions
pins2lts-mc-linux64( 4/ 8), 96.232: ~173 levels ~62914560 states ~127749344 transitions
pins2lts-mc-linux64( 4/ 8), 182.188: ~178 levels ~125829120 states ~259160216 transitions
pins2lts-mc-linux64( 4/ 8), 362.360: ~191 levels ~251658240 states ~560369352 transitions
pins2lts-mc-linux64( 4/ 8), 745.223: ~191 levels ~503316480 states ~1214660096 transitions
pins2lts-mc-linux64( 4/ 8), 1587.837: ~191 levels ~1006632960 states ~2589896128 transitions
pins2lts-mc-linux64( 4/ 8), 1867.289: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1867.296:
pins2lts-mc-linux64( 0/ 8), 1867.296: mean standard work distribution: 264.6% (states) 264.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1867.296:
pins2lts-mc-linux64( 0/ 8), 1867.296: Explored 134216231 states 345992760 transitions, fanout: 2.578
pins2lts-mc-linux64( 0/ 8), 1867.296: Total exploration time 1867.240 sec (1867.220 sec minimum, 1867.231 sec on average)
pins2lts-mc-linux64( 0/ 8), 1867.296: States per second: 71879, Transitions per second: 185296
pins2lts-mc-linux64( 0/ 8), 1867.296:
pins2lts-mc-linux64( 0/ 8), 1867.296: Progress states detected: 4
pins2lts-mc-linux64( 0/ 8), 1867.296: Redundant explorations: -0.0006
pins2lts-mc-linux64( 0/ 8), 1867.297:
pins2lts-mc-linux64( 0/ 8), 1867.297: Queue width: 8B, total height: 208, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1867.297: Tree memory: 1071.2MB, 8.4 B/state, compr.: 6.6%
pins2lts-mc-linux64( 0/ 8), 1867.297: Tree fill ratio (roots/leafs): 99.0%/18.0%
pins2lts-mc-linux64( 0/ 8), 1867.297: Stored 34 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1867.297: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1867.297: Est. total memory use: 1071.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17661931984650930364;'/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' 'X(<>((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17661931984650930364;'/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' 'X(<>((X((LTLAPp1==true))||(LTLAPp0==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)
ITS-tools command line returned an error code 137
[2024-05-29 12:10:04] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:10:04] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-29 12:10:04] [INFO ] Transformed 30 places.
[2024-05-29 12:10:04] [INFO ] Transformed 32 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-29 12:10:04] [INFO ] Time to serialize gal into /tmp/LTLFireability3622229764244258402.gal : 1 ms
[2024-05-29 12:10:04] [INFO ] Time to serialize properties into /tmp/LTLFireability12551967669557251239.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/LTLFireability3622229764244258402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12551967669557251239.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 : !((X(F(("(((CLOSING>=1)&&(xFINACK>=1))||((SYNACK>=1)&&(xSYNRCVD>=1)))")||(("((LISTEN>=1)&&(xSYN>=1))")||(X("((xCLOSED<1)||((SYNACK>=1)...180
Formula 0 simplified : XG(!"(((CLOSING>=1)&&(xFINACK>=1))||((SYNACK>=1)&&(xSYNRCVD>=1)))" & !"((LISTEN>=1)&&(xSYN>=1))" & X!"((xCLOSED<1)||((SYNACK>=1)&&(x...170

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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="TCPcondis-PT-50"
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 TCPcondis-PT-50, 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 r422-smll-171690573500068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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