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.r202-smll-171649587400059.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 HirschbergSinclair-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649587400059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 03:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 03:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 157K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716581112541

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-24 20:05:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 20:05:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 20:05:14] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-24 20:05:14] [INFO ] Transformed 124 places.
[2024-05-24 20:05:14] [INFO ] Transformed 111 transitions.
[2024-05-24 20:05:14] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 118 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 118 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 117 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 117 transition count 108
Applied a total of 10 rules in 67 ms. Remains 117 /124 variables (removed 7) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 117 cols
[2024-05-24 20:05:15] [INFO ] Computed 9 invariants in 26 ms
[2024-05-24 20:05:15] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-24 20:05:15] [INFO ] Invariant cache hit.
[2024-05-24 20:05:16] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-24 20:05:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 2/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 4/117 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 108/225 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 126 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4804 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 2/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 4/117 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 108/225 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 103/229 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 229 constraints, problems are : Problem set: 0 solved, 103 unsolved in 7569 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 12537ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 12580ms
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 108/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13579 ms. Remains : 117/124 places, 108/111 transitions.
Support contains 38 out of 117 places after structural reductions.
[2024-05-24 20:05:29] [INFO ] Flatten gal took : 51 ms
[2024-05-24 20:05:29] [INFO ] Flatten gal took : 22 ms
[2024-05-24 20:05:29] [INFO ] Input system was already deterministic with 108 transitions.
Support contains 36 out of 117 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (360 resets) in 1894 ms. (21 steps per ms) remains 7/28 properties
BEST_FIRST walk for 40004 steps (104 resets) in 375 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (105 resets) in 225 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (104 resets) in 179 ms. (222 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (107 resets) in 247 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (108 resets) in 219 ms. (181 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (87 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (109 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
[2024-05-24 20:05:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 93/105 variables, 7/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/110 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 7 (OVERLAPS) 108/218 variables, 110/119 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/119 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Real declared 225/225 variables, and 126 constraints, problems are : Problem set: 7 solved, 0 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 117 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 117 transition count 108
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(p1) U (!((p2 U p3)&&p2) U G(p0)))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 112 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 110 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 110 transition count 102
Applied a total of 13 rules in 27 ms. Remains 110 /117 variables (removed 7) and now considering 102/108 (removed 6) transitions.
// Phase 1: matrix 102 rows 110 cols
[2024-05-24 20:05:31] [INFO ] Computed 8 invariants in 3 ms
[2024-05-24 20:05:31] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 20:05:31] [INFO ] Invariant cache hit.
[2024-05-24 20:05:31] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-24 20:05:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 118 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3423 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 5/110 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 102/212 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 97/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 215 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7049 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 10517ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10520ms
Starting structural reductions in LTL mode, iteration 1 : 110/117 places, 102/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10813 ms. Remains : 110/117 places, 102/108 transitions.
Stuttering acceptance computed with spot in 1057 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p3 (NOT p1)), (AND (NOT p0) (NOT p1)), true, (OR (AND p1 (NOT p2) p3) (AND p0 p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) p3 p1), (AND p0 (NOT p1)), false, (NOT p0), (AND p0 (NOT p1) p3), false, false]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-00
Product exploration explored 100000 steps with 28588 reset in 712 ms.
Product exploration explored 100000 steps with 28636 reset in 506 ms.
Computed a total of 110 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT p2)), (X p3), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p0) p2 p3 (NOT p1)))), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1))))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT p2))), (X (X (OR (AND p0 p3) (AND (NOT p2) p3 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p3)), (X (X (NOT (AND p0 p2 p3 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p0) p2 p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3) (NOT p1)))))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p2 p3)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 44 factoid took 5954 ms. Reduced automaton from 16 states, 43 edges and 4 AP (stutter sensitive) to 13 states, 39 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 520 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p3 (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), true, (OR (AND p1 (NOT p2) p3) (AND p0 p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) p3 p1), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1) p3), false, false]
RANDOM walk for 40000 steps (360 resets) in 1034 ms. (38 steps per ms) remains 15/30 properties
BEST_FIRST walk for 4003 steps (11 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
[2024-05-24 20:05:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 95/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/103 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem apf1 is UNSAT
Problem apf6 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
Problem apf12 is UNSAT
Problem apf16 is UNSAT
Problem apf18 is UNSAT
Problem apf19 is UNSAT
Problem apf20 is UNSAT
Problem apf23 is UNSAT
Problem apf24 is UNSAT
Problem apf25 is UNSAT
Problem apf26 is UNSAT
Problem apf28 is UNSAT
After SMT solving in domain Real declared 205/212 variables, and 111 constraints, problems are : Problem set: 15 solved, 0 unsolved in 250 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 103/110 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 259ms problems are : Problem set: 15 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 15 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 p1), (X (NOT p2)), (X p3), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p0) p2 p3 (NOT p1)))), (X (OR (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1))))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT p2))), (X (X (OR (AND p0 p3) (AND (NOT p2) p3 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p3)), (X (X (NOT (AND p0 p2 p3 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p0) p2 p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3) (NOT p1)))))), (X (X (OR (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p0 p2 p3)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (G p1)), (G (OR p2 (NOT p3) (NOT p0) (NOT p1))), (G (OR (NOT p2) p3 p0 p1)), (G (OR (NOT p2) (NOT p3) p0 p1)), (G (OR (NOT p2) p3 (NOT p0) (NOT p1))), (G (OR (NOT p2) (NOT p3) (NOT p0) (NOT p1))), (G (OR (NOT p2) p3 (NOT p0))), (G (OR (NOT p0) p1)), (G (OR (NOT p2) p3 (NOT p0) p1)), (G (AND (OR p2 (NOT p0) p1) (OR p3 (NOT p0) p1))), (G (OR (NOT p2) p3 p0)), (G (OR (NOT p2) (NOT p3) (NOT p0) p1)), (G (OR (NOT p2) p3 p0 (NOT p1))), (G (OR (NOT p3) (NOT p0) p1)), (G (OR p2 (NOT p3) (NOT p0) p1)), (G (OR (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (AND (OR p2 p0 p1) (OR p3 p0 p1)))), (F (NOT (AND (OR p2 (NOT p0)) (OR p3 (NOT p0)) (OR (NOT p0) (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p3) p0 (NOT p1)))), (F p2), (F (NOT p1)), (F (NOT p3)), (F p0), (F (NOT (OR (AND (NOT p2) p3 p1) (AND p3 p0)))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (F (NOT (OR p2 (NOT p3) p0 p1))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)) (AND (NOT p0) p1)))), (F (NOT (AND (OR p2 (NOT p0) (NOT p1)) (OR p3 (NOT p0) (NOT p1))))), (F (NOT (AND (OR (NOT p2) (NOT p3) (NOT p0)) (OR (NOT p2) (NOT p3) (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p3) p0))), (F (NOT (AND (NOT p2) p3 (NOT p0) p1)))]
Knowledge based reduction with 59 factoid took 20711 ms. Reduced automaton from 13 states, 39 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) p2 p3)]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) p2 p3)]
[2024-05-24 20:06:13] [INFO ] Invariant cache hit.
[2024-05-24 20:06:13] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 10 ms returned sat
[2024-05-24 20:06:13] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-24 20:06:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 20:06:13] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 10 ms returned sat
[2024-05-24 20:06:13] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-24 20:06:13] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 50 ms.
[2024-05-24 20:06:14] [INFO ] Added : 20 causal constraints over 4 iterations in 208 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 102/102 transitions.
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 105 transition count 60
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 76 place count 68 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 66 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 65 transition count 57
Applied a total of 80 rules in 65 ms. Remains 65 /110 variables (removed 45) and now considering 57/102 (removed 45) transitions.
// Phase 1: matrix 57 rows 65 cols
[2024-05-24 20:06:14] [INFO ] Computed 8 invariants in 3 ms
[2024-05-24 20:06:14] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-24 20:06:14] [INFO ] Invariant cache hit.
[2024-05-24 20:06:14] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-24 20:06:14] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-24 20:06:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 50/108 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/108 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/122 variables, and 66 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1093 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/65 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 50/108 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 48/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/122 variables, and 114 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1221 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/65 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 2330ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2332ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/110 places, 57/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2961 ms. Remains : 65/110 places, 57/102 transitions.
Computed a total of 65 stabilizing places and 57 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 65 transition count 57
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 4438 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) p2 p3)]
RANDOM walk for 40000 steps (628 resets) in 195 ms. (204 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40002 steps (197 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
[2024-05-24 20:06:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/58 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 108/122 variables, and 66 constraints, problems are : Problem set: 1 solved, 0 unsolved in 87 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3), (X (NOT p2)), (X p3), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 (NOT p1) p3))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)) (AND (NOT p2) p3)))), (F p2), (F (NOT p3)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 28 factoid took 13143 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) p2 p3)]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) p2 p3)]
[2024-05-24 20:06:35] [INFO ] Invariant cache hit.
[2024-05-24 20:06:35] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 20:06:35] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-24 20:06:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 20:06:35] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2024-05-24 20:06:35] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-24 20:06:35] [INFO ] Computed and/alt/rep : 48/52/48 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 20:06:35] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) p2 p3)]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-00 finished in 64650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 113 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 113 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 111 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 111 transition count 103
Applied a total of 11 rules in 9 ms. Remains 111 /117 variables (removed 6) and now considering 103/108 (removed 5) transitions.
// Phase 1: matrix 103 rows 111 cols
[2024-05-24 20:06:36] [INFO ] Computed 8 invariants in 2 ms
[2024-05-24 20:06:36] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-24 20:06:36] [INFO ] Invariant cache hit.
[2024-05-24 20:06:36] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-24 20:06:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 103/214 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/214 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 119 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3463 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 103/214 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 98/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 217 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6019 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 9524ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 9527ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 103/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9794 ms. Remains : 111/117 places, 103/108 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 79 steps with 1 reset in 2 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-01 finished in 9964 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 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 111 transition count 59
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 67 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 66 transition count 58
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 63 transition count 55
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 63 transition count 55
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 63 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 62 transition count 54
Applied a total of 99 rules in 17 ms. Remains 62 /117 variables (removed 55) and now considering 54/108 (removed 54) transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-05-24 20:06:45] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 20:06:46] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-24 20:06:46] [INFO ] Invariant cache hit.
[2024-05-24 20:06:46] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-24 20:06:46] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-24 20:06:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 48/103 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 1/104 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/116 variables, and 64 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1350 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 48/103 variables, 55/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 45/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 1/104 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/116 variables, and 109 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1476 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/62 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 2836ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 2837ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/117 places, 54/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3080 ms. Remains : 62/117 places, 54/108 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-04
Stuttering criterion allowed to conclude after 315 steps with 24 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-04 finished in 3184 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 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 111 transition count 61
Reduce places removed 42 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 69 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 67 transition count 59
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 64 transition count 56
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 64 transition count 56
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 64 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 97 place count 63 transition count 55
Applied a total of 97 rules in 11 ms. Remains 63 /117 variables (removed 54) and now considering 55/108 (removed 53) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-24 20:06:49] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 20:06:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-24 20:06:49] [INFO ] Invariant cache hit.
[2024-05-24 20:06:49] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-24 20:06:49] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-24 20:06:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/118 variables, and 64 constraints, problems are : Problem set: 0 solved, 46 unsolved in 845 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/63 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/118 variables, and 110 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1222 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/63 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 2076ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2076ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/117 places, 55/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2270 ms. Remains : 63/117 places, 55/108 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-07
Product exploration explored 100000 steps with 2099 reset in 244 ms.
Product exploration explored 100000 steps with 2102 reset in 196 ms.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 162 steps (0 resets) in 4 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 55/55 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-05-24 20:06:52] [INFO ] Invariant cache hit.
[2024-05-24 20:06:52] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-24 20:06:52] [INFO ] Invariant cache hit.
[2024-05-24 20:06:52] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-24 20:06:52] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-24 20:06:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/118 variables, and 64 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1134 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/63 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/118 variables, and 110 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1042 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/63 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 2185ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2185ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2370 ms. Remains : 63/63 places, 55/55 transitions.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 159 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2070 reset in 152 ms.
Product exploration explored 100000 steps with 2097 reset in 272 ms.
Built C files in :
/tmp/ltsmin8990262302815049709
[2024-05-24 20:06:55] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2024-05-24 20:06:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 20:06:55] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2024-05-24 20:06:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 20:06:55] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2024-05-24 20:06:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 20:06:55] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8990262302815049709
Running compilation step : cd /tmp/ltsmin8990262302815049709;'/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 442 ms.
Running link step : cd /tmp/ltsmin8990262302815049709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin8990262302815049709;'/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/stateBased6085946912830221870.hoa' '--buchi-type=spotba'
LTSmin run took 593 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-07 finished in 7956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 111 transition count 62
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 70 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 69 transition count 61
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 66 transition count 58
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 66 transition count 58
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 66 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 93 place count 65 transition count 57
Applied a total of 93 rules in 17 ms. Remains 65 /117 variables (removed 52) and now considering 57/108 (removed 51) transitions.
// Phase 1: matrix 57 rows 65 cols
[2024-05-24 20:06:57] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 20:06:57] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-24 20:06:57] [INFO ] Invariant cache hit.
[2024-05-24 20:06:57] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-24 20:06:57] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-24 20:06:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/109 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/122 variables, and 67 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1305 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 59/65 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/109 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 48/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 1/110 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/110 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/122 variables, and 115 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1518 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 59/65 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 2844ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2846ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/117 places, 57/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3078 ms. Remains : 65/117 places, 57/108 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-09
Stuttering criterion allowed to conclude after 3456 steps with 136 reset in 11 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-09 finished in 3206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(p1)))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 112 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 109 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 109 transition count 101
Applied a total of 15 rules in 13 ms. Remains 109 /117 variables (removed 8) and now considering 101/108 (removed 7) transitions.
// Phase 1: matrix 101 rows 109 cols
[2024-05-24 20:07:00] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 20:07:00] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-24 20:07:00] [INFO ] Invariant cache hit.
[2024-05-24 20:07:00] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 20:07:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3102 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6568 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 9713ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 9716ms
Starting structural reductions in LTL mode, iteration 1 : 109/117 places, 101/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10026 ms. Remains : 109/117 places, 101/108 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-10 finished in 10194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 112 transition count 63
Reduce places removed 41 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 44 rules applied. Total rules applied 86 place count 71 transition count 60
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 68 transition count 60
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 64 transition count 56
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 64 transition count 56
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 64 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 63 transition count 55
Applied a total of 99 rules in 9 ms. Remains 63 /117 variables (removed 54) and now considering 55/108 (removed 53) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-24 20:07:10] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 20:07:10] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-24 20:07:10] [INFO ] Invariant cache hit.
[2024-05-24 20:07:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 20:07:10] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-05-24 20:07:10] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-24 20:07:10] [INFO ] Invariant cache hit.
[2024-05-24 20:07:10] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/106 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/118 variables, and 73 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1460 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/106 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/118 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 939 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 2411ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2416ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/117 places, 55/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2669 ms. Remains : 63/117 places, 55/108 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-11
Product exploration explored 100000 steps with 1664 reset in 107 ms.
Product exploration explored 100000 steps with 1665 reset in 120 ms.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 149 steps (0 resets) in 7 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 55/55 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2024-05-24 20:07:13] [INFO ] Invariant cache hit.
[2024-05-24 20:07:14] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-24 20:07:14] [INFO ] Invariant cache hit.
[2024-05-24 20:07:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 20:07:14] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-24 20:07:14] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-24 20:07:14] [INFO ] Invariant cache hit.
[2024-05-24 20:07:14] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/106 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/118 variables, and 73 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1288 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 49/106 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/118 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1535 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 2836ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2838ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3149 ms. Remains : 63/63 places, 55/55 transitions.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 151 steps (0 resets) in 5 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1664 reset in 163 ms.
Product exploration explored 100000 steps with 1665 reset in 182 ms.
Built C files in :
/tmp/ltsmin4149925201474362354
[2024-05-24 20:07:17] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2024-05-24 20:07:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 20:07:17] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2024-05-24 20:07:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 20:07:17] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2024-05-24 20:07:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 20:07:17] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4149925201474362354
Running compilation step : cd /tmp/ltsmin4149925201474362354;'/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 375 ms.
Running link step : cd /tmp/ltsmin4149925201474362354;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4149925201474362354;'/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/stateBased2040492431617858757.hoa' '--buchi-type=spotba'
LTSmin run took 1842 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-11 finished in 9717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p1)||(p1&&F(p2))))||p0)))'
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 115 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 114 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 114 transition count 105
Applied a total of 6 rules in 4 ms. Remains 114 /117 variables (removed 3) and now considering 105/108 (removed 3) transitions.
// Phase 1: matrix 105 rows 114 cols
[2024-05-24 20:07:20] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 20:07:20] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-24 20:07:20] [INFO ] Invariant cache hit.
[2024-05-24 20:07:20] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-24 20:07:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 4/114 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 105/219 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 123 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3586 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 4/114 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 105/219 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 100/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 223 constraints, problems are : Problem set: 0 solved, 100 unsolved in 8221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 11843ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 11846ms
Starting structural reductions in LTL mode, iteration 1 : 114/117 places, 105/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12092 ms. Remains : 114/117 places, 105/108 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-13
Stuttering criterion allowed to conclude after 13664 steps with 130 reset in 20 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-13 finished in 12334 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 U p1))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Graph (complete) has 219 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 112 transition count 70
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 78 transition count 70
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 74 transition count 66
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 74 transition count 66
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 74 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 73 transition count 65
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 72 transition count 64
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 72 transition count 64
Applied a total of 81 rules in 14 ms. Remains 72 /117 variables (removed 45) and now considering 64/108 (removed 44) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-05-24 20:07:32] [INFO ] Computed 8 invariants in 6 ms
[2024-05-24 20:07:32] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-24 20:07:32] [INFO ] Invariant cache hit.
[2024-05-24 20:07:32] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-24 20:07:32] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-24 20:07:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 3/69 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 61/130 variables, 69/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/136 variables, and 77 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1857 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/72 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 3/69 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 61/130 variables, 69/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 58/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/136 variables, and 135 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1304 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/72 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 3181ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/117 places, 64/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3417 ms. Remains : 72/117 places, 64/108 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLCardinality-15
Stuttering criterion allowed to conclude after 135 steps with 1 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLCardinality-15 finished in 3518 ms.
All properties solved by simple procedures.
Total runtime 141489 ms.

BK_STOP 1716581256465

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -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="HirschbergSinclair-PT-05"
export BK_EXAMINATION="LTLCardinality"
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 HirschbergSinclair-PT-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-171649587400059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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