About the Execution of ITS-Tools for HirschbergSinclair-PT-35
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ??FTTFTFFTFFTFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422100107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is HirschbergSinclair-PT-35, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422100107
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 544K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-35-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748781820478
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-35
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 12:43:41] [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]
[2025-06-01 12:43:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 12:43:42] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2025-06-01 12:43:42] [INFO ] Transformed 998 places.
[2025-06-01 12:43:42] [INFO ] Transformed 922 transitions.
[2025-06-01 12:43:42] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 922/922 transitions.
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 964 transition count 922
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 62 place count 936 transition count 894
Iterating global reduction 1 with 28 rules applied. Total rules applied 90 place count 936 transition count 894
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 113 place count 913 transition count 871
Iterating global reduction 1 with 23 rules applied. Total rules applied 136 place count 913 transition count 871
Applied a total of 136 rules in 293 ms. Remains 913 /998 variables (removed 85) and now considering 871/922 (removed 51) transitions.
// Phase 1: matrix 871 rows 913 cols
[2025-06-01 12:43:42] [INFO ] Computed 42 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:43:43] [INFO ] Implicit Places using invariants in 895 ms returned []
[2025-06-01 12:43:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:43:54] [INFO ] Implicit Places using invariants and state equation in 10453 ms returned []
Implicit Place search using SMT with State Equation took 11398 ms to find 0 implicit places.
Running 836 sub problems to find dead transitions.
[2025-06-01 12:43:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/877 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 877/1784 variables, and 6 constraints, problems are : Problem set: 0 solved, 836 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/41 constraints, State Equation: 0/913 constraints, PredecessorRefiner: 836/836 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 836 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/877 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/877 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 2 (OVERLAPS) 2/879 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 879/1784 variables, and 7 constraints, problems are : Problem set: 0 solved, 836 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/41 constraints, State Equation: 0/913 constraints, PredecessorRefiner: 0/836 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 836 unsolved
Search for dead transitions found 0 dead transitions in 60353ms
Starting structural reductions in LTL mode, iteration 1 : 913/998 places, 871/922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72072 ms. Remains : 913/998 places, 871/922 transitions.
Support contains 58 out of 913 places after structural reductions.
[2025-06-01 12:44:54] [INFO ] Flatten gal took : 95 ms
[2025-06-01 12:44:54] [INFO ] Flatten gal took : 53 ms
[2025-06-01 12:44:55] [INFO ] Input system was already deterministic with 871 transitions.
Support contains 56 out of 913 places (down from 58) after GAL structural reductions.
RANDOM walk for 40000 steps (40 resets) in 1830 ms. (21 steps per ms) remains 10/36 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
[2025-06-01 12:44:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 818/830 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/830 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/833 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/833 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 5/838 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Real declared 1709/1784 variables, and 880 constraints, problems are : Problem set: 10 solved, 0 unsolved in 1274 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 838/913 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1298ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 913 stabilizing places and 871 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 913 transition count 871
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-35-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(X(F(p1)))))))'
Support contains 4 out of 913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 913/913 places, 871/871 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 912 transition count 871
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 902 transition count 861
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 902 transition count 861
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 897 transition count 856
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 897 transition count 856
Applied a total of 31 rules in 108 ms. Remains 897 /913 variables (removed 16) and now considering 856/871 (removed 15) transitions.
// Phase 1: matrix 856 rows 897 cols
[2025-06-01 12:44:57] [INFO ] Computed 41 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:44:58] [INFO ] Implicit Places using invariants in 475 ms returned []
[2025-06-01 12:44:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:45:08] [INFO ] Implicit Places using invariants and state equation in 10366 ms returned []
Implicit Place search using SMT with State Equation took 10847 ms to find 0 implicit places.
Running 821 sub problems to find dead transitions.
[2025-06-01 12:45:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 2 (OVERLAPS) 35/897 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/1753 variables, and 41 constraints, problems are : Problem set: 0 solved, 821 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/897 constraints, PredecessorRefiner: 821/821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 821 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 2 (OVERLAPS) 35/897 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/1753 variables, and 41 constraints, problems are : Problem set: 0 solved, 821 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/897 constraints, PredecessorRefiner: 0/821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 821 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 897/913 places, 856/871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71140 ms. Remains : 897/913 places, 856/871 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-00
Product exploration explored 100000 steps with 142 reset in 409 ms.
Product exploration explored 100000 steps with 143 reset in 374 ms.
Computed a total of 897 stabilizing places and 856 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 897 transition count 856
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3635 steps (0 resets) in 55 ms. (64 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-01 12:46:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:46:11] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 144 ms returned sat
[2025-06-01 12:46:16] [INFO ] [Real]Absence check using state equation in 4250 ms returned sat
[2025-06-01 12:46:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:46:16] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 156 ms returned sat
[2025-06-01 12:46:31] [INFO ] [Nat]Absence check using state equation in 14366 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 897 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 897/897 places, 856/856 transitions.
Applied a total of 0 rules in 32 ms. Remains 897 /897 variables (removed 0) and now considering 856/856 (removed 0) transitions.
[2025-06-01 12:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:46:31] [INFO ] Implicit Places using invariants in 454 ms returned []
[2025-06-01 12:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:46:42] [INFO ] Implicit Places using invariants and state equation in 10358 ms returned []
Implicit Place search using SMT with State Equation took 10830 ms to find 0 implicit places.
Running 821 sub problems to find dead transitions.
[2025-06-01 12:46:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 2 (OVERLAPS) 35/897 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 671.0)
(s6 0.0)
(s7 671.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 668.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 668.0)
(s20 0.0)
(s21 667.0)
(s22 665.0)
(s23 1.0)
(s24 664.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 662.0)
(s33 1.0)
(s34 0.0)
(s35 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/1753 variables, and 41 constraints, problems are : Problem set: 0 solved, 821 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/897 constraints, PredecessorRefiner: 821/821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 821 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 2 (OVERLAPS) 35/897 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/1753 variables, and 41 constraints, problems are : Problem set: 0 solved, 821 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/897 constraints, PredecessorRefiner: 0/821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 821 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in LTL mode , in 1 iterations and 71045 ms. Remains : 897/897 places, 856/856 transitions.
Computed a total of 897 stabilizing places and 856 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 897 transition count 856
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3608 steps (0 resets) in 65 ms. (54 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-01 12:47:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:47:43] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 143 ms returned sat
[2025-06-01 12:47:48] [INFO ] [Real]Absence check using state equation in 4311 ms returned sat
[2025-06-01 12:47:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:47:48] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 156 ms returned sat
[2025-06-01 12:48:03] [INFO ] [Nat]Absence check using state equation in 14363 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 142 reset in 296 ms.
Product exploration explored 100000 steps with 142 reset in 327 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 897 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 897/897 places, 856/856 transitions.
Performed 387 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 897 transition count 856
Deduced a syphon composed of 387 places in 3 ms
Applied a total of 387 rules in 119 ms. Remains 897 /897 variables (removed 0) and now considering 856/856 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:48:04] [INFO ] Redundant transitions in 41 ms returned []
Running 821 sub problems to find dead transitions.
// Phase 1: matrix 856 rows 897 cols
[2025-06-01 12:48:04] [INFO ] Computed 41 invariants in 7 ms
[2025-06-01 12:48:04] [INFO ] State equation strengthened by 387 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 2 (OVERLAPS) 35/897 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/1753 variables, and 41 constraints, problems are : Problem set: 0 solved, 821 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/897 constraints, ReadFeed: 0/387 constraints, PredecessorRefiner: 821/821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 821 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 2 (OVERLAPS) 35/897 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/1753 variables, and 41 constraints, problems are : Problem set: 0 solved, 821 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/897 constraints, ReadFeed: 0/387 constraints, PredecessorRefiner: 0/821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 821 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in SI_LTL mode, iteration 1 : 897/897 places, 856/856 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60366 ms. Remains : 897/897 places, 856/856 transitions.
Built C files in :
/tmp/ltsmin15288931272877010522
[2025-06-01 12:49:04] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15288931272877010522
Running compilation step : cd /tmp/ltsmin15288931272877010522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1540 ms.
Running link step : cd /tmp/ltsmin15288931272877010522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15288931272877010522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13584952013330064417.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 897 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 897/897 places, 856/856 transitions.
Applied a total of 0 rules in 32 ms. Remains 897 /897 variables (removed 0) and now considering 856/856 (removed 0) transitions.
// Phase 1: matrix 856 rows 897 cols
[2025-06-01 12:49:19] [INFO ] Computed 41 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:49:20] [INFO ] Implicit Places using invariants in 401 ms returned []
[2025-06-01 12:49:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:49:30] [INFO ] Implicit Places using invariants and state equation in 10597 ms returned []
Implicit Place search using SMT with State Equation took 11003 ms to find 0 implicit places.
Running 821 sub problems to find dead transitions.
[2025-06-01 12:49:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 2 (OVERLAPS) 35/897 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 671.0)
(s6 0.0)
(s7 671.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 668.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 668.0)
(s20 0.0)
(s21 667.0)
(s22 665.0)
(s23 1.0)
(s24 664.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 662.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 658.0)
(s40 0.0)
(s41 657.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 648.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 643.0)
(s61 1.0)
(s62 641.0)
(s63 1.0)
(s64 0.0)
(s65 642.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 674.0)
(s72 1.0)
(s73 673.0)
(s74 1.0)
(s75 673.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 671.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 670.0)
(s98 1.0)
(s99 669.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 669.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 664.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 663.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 663.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 662.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 660.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 656.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 655.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 654.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 653.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 652.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 650.0)
(s182 1.0)
(s183 647.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 646.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 640.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 timeout
1.0)
(s495 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/1753 variables, and 41 constraints, problems are : Problem set: 0 solved, 821 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/897 constraints, PredecessorRefiner: 821/821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 821 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 821 unsolved
At refinement iteration 2 (OVERLAPS) 35/897 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/1753 variables, and 41 constraints, problems are : Problem set: 0 solved, 821 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/897 constraints, PredecessorRefiner: 0/821 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 821 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in LTL mode , in 1 iterations and 71216 ms. Remains : 897/897 places, 856/856 transitions.
Built C files in :
/tmp/ltsmin15477074109907681857
[2025-06-01 12:50:31] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15477074109907681857
Running compilation step : cd /tmp/ltsmin15477074109907681857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1514 ms.
Running link step : cd /tmp/ltsmin15477074109907681857;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15477074109907681857;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased722672231789434440.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 12:50:46] [INFO ] Flatten gal took : 35 ms
[2025-06-01 12:50:46] [INFO ] Flatten gal took : 35 ms
[2025-06-01 12:50:46] [INFO ] Time to serialize gal into /tmp/LTL12654935013512492974.gal : 8 ms
[2025-06-01 12:50:46] [INFO ] Time to serialize properties into /tmp/LTL5080454982890069341.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12654935013512492974.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8552845551476000239.hoa' '-atoms' '/tmp/LTL5080454982890069341.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5080454982890069341.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8552845551476000239.hoa
Detected timeout of ITS tools.
[2025-06-01 12:51:01] [INFO ] Flatten gal took : 31 ms
[2025-06-01 12:51:01] [INFO ] Flatten gal took : 30 ms
[2025-06-01 12:51:01] [INFO ] Time to serialize gal into /tmp/LTL5543735895274654038.gal : 16 ms
[2025-06-01 12:51:01] [INFO ] Time to serialize properties into /tmp/LTL15959909205218224761.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5543735895274654038.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15959909205218224761.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(elected_35_to_left_12>rcv_left_reply_32_0_32)")||(X(X(X(F("(reply_35_5_to_left_12>rcv_left_reply_3_0_3)"))))))))
Formula 0 simplified : G(!"(elected_35_to_left_12>rcv_left_reply_32_0_32)" & XXXG!"(reply_35_5_to_left_12>rcv_left_reply_3_0_3)")
Detected timeout of ITS tools.
[2025-06-01 12:51:16] [INFO ] Flatten gal took : 27 ms
[2025-06-01 12:51:16] [INFO ] Applying decomposition
[2025-06-01 12:51:16] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17176391652012143677.txt' '-o' '/tmp/graph17176391652012143677.bin' '-w' '/tmp/graph17176391652012143677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17176391652012143677.bin' '-l' '-1' '-v' '-w' '/tmp/graph17176391652012143677.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:51:16] [INFO ] Decomposing Gal with order
[2025-06-01 12:51:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:51:17] [INFO ] Removed a total of 72 redundant transitions.
[2025-06-01 12:51:17] [INFO ] Flatten gal took : 106 ms
[2025-06-01 12:51:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-01 12:51:17] [INFO ] Time to serialize gal into /tmp/LTL11156707967318746700.gal : 10 ms
[2025-06-01 12:51:17] [INFO ] Time to serialize properties into /tmp/LTL6845317183754021578.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11156707967318746700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6845317183754021578.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(gu84.elected_35_to_left_12>gu84.rcv_left_reply_32_0_32)")||(X(X(X(F("(gu65.reply_35_5_to_left_12>gu65.rcv_left_reply_3_0_3)"))...161
Formula 0 simplified : G(!"(gu84.elected_35_to_left_12>gu84.rcv_left_reply_32_0_32)" & XXXG!"(gu65.reply_35_5_to_left_12>gu65.rcv_left_reply_3_0_3)")
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-00 finished in 394730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 913 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 913/913 places, 871/871 transitions.
Graph (complete) has 1742 edges and 913 vertex of which 912 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 35 places and 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 384 transitions
Trivial Post-agglo rules discarded 384 transitions
Performed 384 trivial Post agglomeration. Transition count delta: 384
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 877 transition count 452
Reduce places removed 384 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 386 rules applied. Total rules applied 771 place count 493 transition count 450
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 773 place count 491 transition count 450
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 784 place count 480 transition count 439
Iterating global reduction 3 with 11 rules applied. Total rules applied 795 place count 480 transition count 439
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 800 place count 480 transition count 434
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 805 place count 475 transition count 434
Applied a total of 805 rules in 82 ms. Remains 475 /913 variables (removed 438) and now considering 434/871 (removed 437) transitions.
// Phase 1: matrix 434 rows 475 cols
[2025-06-01 12:51:32] [INFO ] Computed 41 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:51:33] [INFO ] Implicit Places using invariants in 703 ms returned []
[2025-06-01 12:51:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:51:44] [INFO ] Implicit Places using invariants and state equation in 11422 ms returned []
Implicit Place search using SMT with State Equation took 12137 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:51:44] [INFO ] Redundant transitions in 6 ms returned []
Running 365 sub problems to find dead transitions.
[2025-06-01 12:51:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/777 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "ParserException while parsing response: ((t47 0.0)
(t48 0.0)
(t49 1.0)
(t50 0.0)
(t69 1.0)
(t70 1.0)
(t71 1.0)
(t72 1.0)
(t73 1.0)
(t74 1.0)
(t75 1.0)
(t76 1.0)
(t77 1.0)
(t78 1.0)
(t79 1.0)
(t80 1.0)
(t81 1.0)
(t82 1.0)
(t83 1.0)
(t84 1.0)
(t85 1.0)
(t86 1.0)
(t87 1.0)
(t88 1.0)
(t89 1.0)
(t90 1.0)
(t91 1.0)
(t92 1.0)
(t93 1.0)
(t94 1.0)
(t95 1.0)
(t96 1.0)
(t97 1.0)
(t98 1.0)
(t99 1.0)
(t100 1.0)
(t101 1.0)
(t102 1.0)
(t103 1.0)
(t104 1.0)
(t105 1.0)
(t106 1.0)
(t107 1.0)
(t108 1.0)
(t109 1.0)
(t110 1.0)
(t111 1.0)
(t112 1.0)
(t113 1.0)
(t114 1.0)
(t115 1.0)
(t116 1.0)
(t117 1.0)
(t118 1.0)
(t119 1.0)
(t120 1.0)
(t121 1.0)
(t122 1.0)
(t123 1.0)
(t124 1.0)
(t125 1.0)
(t126 1.0)
(t127 1.0)
(t128 1.0)
(t129 1.0)
(t130 1.0)
(t131 1.0)
(t132 1.0)
(t133 1.0)
(t134 1.0)
(t135 1.0)
(t136 1.0)
(t137 1.0)
(t138 1.0)
(t139 1.0)
(t140 1.0)
(t141 1.0)
(t142 1.0)
(t143 1.0)
(t144 1.0)
(t145 1.0)
(t146 1.0)
(t147 1.0)
(t148 1.0)
(t149 1.0)
(t150 1.0)
(t151 1.0)
(t152 1.0)
(t153 1.0)
(t154 1.0)
(t155 1.0)
(t156 1.0)
(t157 1.0)
(t158 1.0)
(t159 1.0)
(t160 1.0)
(t161 1.0)
(t162 1.0)
(t163 1.0)
(t164 1.0)
(t165 1.0)
(t166 1.0)
(t167 1.0)
(t168 1.0)
(t169 1.0)
(t170 1.0)
(t171 1.0)
(t172 1.0)
(t173 1.0)
(t174 1.0)
(t175 1.0)
(t176 1.0)
(t177 1.0)
(t178 1.0)
(t179 1.0)
(t180 1.0)
(t181 1.0)
(t182 1.0)
(t183 1.0)
(t184 1.0)
(t185 1.0)
(t186 1.0)
(t187 1.0)
(t188 1.0)
(t189 1.0)
(t190 1.0)
(t191 1.0)
(t192 1.0)
(t193 1.0)
(t194 1.0)
(t195 1.0)
(t196 1.0)
(t197 1.0)
(t198 1.0)
(t199 1.0)
(t200 1.0)
(t201 1.0)
(t202 1.0)
(t203 1.0)
(t204 1.0)
(t205 1.0)
(t206 1.0)
(t207 1.0)
(t208 1.0)
(t209 1.0)
(t210 1.0)
(t211 1.0)
(t212 1.0)
(t213 1.0)
(t214 1.0)
(t215 1.0)
(t216 1.0)
(t217 1.0)
(t218 1.0)
(t219 1.0)
(t220 1.0)
(t221 1.0)
(t222 1.0)
(t223 1.0)
(t224 1.0)
(t225 1.0)
(t226 1.0)
(t227 1.0)
(t228 1.0)
(t229 1.0)
(t230 1.0)
(t231 1.0)
(t232 1.0)
(t233 1.0)
(t234 1.0)
(t235 1.0)
(t236 1.0)
(t237 1.0)
(t238 1.0)
(t239 1.0)
(t240 1.0)
(t241 1.0)
(t242 1.0)
(t243 1.0)
(t244 1.0)
(t245 1.0)
(t246 1.0)
(t247 1.0)
(t248 1.0)
(t249 1.0)
(t250 1.0)
(t251 1.0)
(t252 1.0)
(t253 1.0)
(t254 1.0)
(t255 1.0)
(t256 1.0)
(t257 1.0)
(t258 1.0)
(t259 1.0)
(t260 1.0)
(t261 1.0)
(t262 0.0)
(t263 1.0)
(t264 1.0)
(t265 1.0)
(t266 1.0)
(t267 1.0)
(t268 1.0)
(t269 1.0)
(t270 1.0)
(t271 1.0)
(t272 1.0)
(t273 1.0)
(t274 1.0)
(t275 1.0)
(t276 1.0)
(t277 1.0)
(t278 1.0)
(t279 1.0)
(t280 1.0)
(t281 1.0)
(t282 1.0)
(t283 1.0)
(t284 1.0)
(t285 1.0)
(t286 1.0)
(t287 1.0)
(t288 1.0)
(t289 1.0)
(t290 1.0)
(t291 1.0)
(t292 1.0)
(t293 1.0)
(t294 1.0)
(t295 1.0)
(t296 1.0)
(t297 1.0)
(t298 1.0)
(t299 1.0)
(t300 1.0)
(t301 1.0)
(t302 1.0)
(t303 1.0)
(t304 1.0)
(t305 1.0)
(t306 1.0)
(t307 1.0)
(t308 1.0)
(t309 1.0)
(t310 1.0)
(t311 1.0)
(t312 1.0)
(t313 1.0)
(t314 1.0)
(t315 1.0)
(t316 0.0)
(t317 0.0)
(t318 0.0)
(t319 0.0)
(t320 0.0)
(t321 0.0)
(t322 0.0)
(t323 0.0)
(t324 0.0)
(t325 0.0)
(t326 0.0)
(t327 0.0)
(t328 0.0)
(t329 0.0)
(t330 0.0)
(t331 0.0)
(t332 0.0)
(t333 0.0)
(t334 0.0)
(t335 0.0)
(t336 0.0)
(t337 0.0)
(t338 0.0)
(t339 0.0)
(t340 0.0)
(t341 0.0)
(t342 0.0)
(t343 0.0)
(t344 0.0)
(t345 0.0)
(t346 0.0)
(t347 0.0)
(t348 0.0)
(t349 0.0)
(t350 0.0)
(t351 0.0)
(t352 0.0)
(t353 0.0)
(t354 0.0)
(t355 0.0)
(t356 0.0)
(t357 0.0)
(t358 0.0)
(t359 0.0)
(t360 0.0)
(t361 0.0)
(t362 0.0)
(t363 0.0)
(t364 0.0)
(t365 0.0)
(t366 0.0)
(t367 0.0)
(t368 0.0)
(t369 0.0)
(t370 0.0)
(t371 0.0)
(t372 0.0)
(t373 0.0)
(t374 0.0)
(t375 0.0)
(t376 0.0)
(t377 0.0)
(t378 0.0)
(t379 0.0)
(t380 0.0)
(t381 0.0)
(t382 0.0)
(t383 0.0)
(t384 0.0)
(t385 0.0)
(t386 0.0)
(t387 0.0)
(t388 0.0)
(t389 0.0)
(t390 0.0)
(t391 0.0)
(t392 0.0)
(t393 0.0)
(t394 0.0)
(t395 0.0)
(t396 0.0)
(t397 0.0)
(t398 0.0)
(t399 0.0)
(t400 0.0)
(t401 0.0)
(t402 0.0)
(t403 0.0)
(t404 timeout
0.0)
(t405 0.0)
(t406 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/909 variables, and 449 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/777 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 365/814 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/909 variables, and 814 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in SI_LTL mode, iteration 1 : 475/913 places, 434/871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72306 ms. Remains : 475/913 places, 434/871 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-01
Product exploration explored 100000 steps with 231 reset in 311 ms.
Product exploration explored 100000 steps with 234 reset in 366 ms.
Computed a total of 475 stabilizing places and 434 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 475 transition count 434
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 121 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1216 steps (0 resets) in 13 ms. (86 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 475 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 434/434 transitions.
Applied a total of 0 rules in 23 ms. Remains 475 /475 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2025-06-01 12:52:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:52:46] [INFO ] Implicit Places using invariants in 598 ms returned []
[2025-06-01 12:52:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:52:58] [INFO ] Implicit Places using invariants and state equation in 11405 ms returned []
Implicit Place search using SMT with State Equation took 12008 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:52:58] [INFO ] Redundant transitions in 2 ms returned []
Running 365 sub problems to find dead transitions.
[2025-06-01 12:52:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/777 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/909 variables, and 449 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/777 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 365/814 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/909 variables, and 814 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72108 ms. Remains : 475/475 places, 434/434 transitions.
Computed a total of 475 stabilizing places and 434 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 475 transition count 434
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 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 87 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1204 steps (0 resets) in 12 ms. (92 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 119 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 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 283 reset in 248 ms.
Product exploration explored 100000 steps with 282 reset in 282 ms.
Built C files in :
/tmp/ltsmin10550358194097248806
[2025-06-01 12:53:59] [INFO ] Computing symmetric may disable matrix : 434 transitions.
[2025-06-01 12:53:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:53:59] [INFO ] Computing symmetric may enable matrix : 434 transitions.
[2025-06-01 12:53:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:53:59] [INFO ] Computing Do-Not-Accords matrix : 434 transitions.
[2025-06-01 12:53:59] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:53:59] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10550358194097248806
Running compilation step : cd /tmp/ltsmin10550358194097248806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 948 ms.
Running link step : cd /tmp/ltsmin10550358194097248806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10550358194097248806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3840559372190394236.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 434/434 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 475 transition count 432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 473 transition count 432
Applied a total of 4 rules in 33 ms. Remains 473 /475 variables (removed 2) and now considering 432/434 (removed 2) transitions.
// Phase 1: matrix 432 rows 473 cols
[2025-06-01 12:54:14] [INFO ] Computed 41 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:54:15] [INFO ] Implicit Places using invariants in 651 ms returned []
[2025-06-01 12:54:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:54:27] [INFO ] Implicit Places using invariants and state equation in 12063 ms returned []
Implicit Place search using SMT with State Equation took 12717 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:54:27] [INFO ] Redundant transitions in 2 ms returned []
Running 363 sub problems to find dead transitions.
[2025-06-01 12:54:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 2/406 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 367/773 variables, 406/447 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/905 variables, and 447 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 406/473 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 2/406 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 367/773 variables, 406/447 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/773 variables, 363/810 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/905 variables, and 810 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 406/473 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in SI_LTL mode, iteration 1 : 473/475 places, 432/434 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72823 ms. Remains : 473/475 places, 432/434 transitions.
Built C files in :
/tmp/ltsmin15474338877543775266
[2025-06-01 12:55:27] [INFO ] Computing symmetric may disable matrix : 432 transitions.
[2025-06-01 12:55:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:55:27] [INFO ] Computing symmetric may enable matrix : 432 transitions.
[2025-06-01 12:55:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:55:27] [INFO ] Computing Do-Not-Accords matrix : 432 transitions.
[2025-06-01 12:55:27] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:55:27] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15474338877543775266
Running compilation step : cd /tmp/ltsmin15474338877543775266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 928 ms.
Running link step : cd /tmp/ltsmin15474338877543775266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15474338877543775266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3625874520533972994.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 12:55:42] [INFO ] Flatten gal took : 20 ms
[2025-06-01 12:55:42] [INFO ] Flatten gal took : 16 ms
[2025-06-01 12:55:42] [INFO ] Time to serialize gal into /tmp/LTL2323093798132370943.gal : 3 ms
[2025-06-01 12:55:42] [INFO ] Time to serialize properties into /tmp/LTL8146094099713623342.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2323093798132370943.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16207644559044120237.hoa' '-atoms' '/tmp/LTL8146094099713623342.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8146094099713623342.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16207644559044120237.hoa
Reverse transition relation is NOT exact ! Due to transitions t37.t38, t41.t42, t47.t48, t51.t52, t55.t56, t59.t60, t65.t66, t69.t70, t74.t75, t78.t79, t82...525
Computing Next relation with stutter on 2.93367e+25 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:55:57] [INFO ] Flatten gal took : 12 ms
[2025-06-01 12:55:57] [INFO ] Flatten gal took : 11 ms
[2025-06-01 12:55:57] [INFO ] Time to serialize gal into /tmp/LTL7399426483572396411.gal : 2 ms
[2025-06-01 12:55:57] [INFO ] Time to serialize properties into /tmp/LTL6889739343473380344.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7399426483572396411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6889739343473380344.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(rcv_left_election_35_2_3_3<=election_35_6_21_to_left_15)")))&&(F("(election_35_5_28_to_right_27<=rcv_left_election_24_0_1_...164
Formula 0 simplified : F(GF!"(rcv_left_election_35_2_3_3<=election_35_6_21_to_left_15)" | G!"(election_35_5_28_to_right_27<=rcv_left_election_24_0_1_25)")
Reverse transition relation is NOT exact ! Due to transitions t37.t38, t41.t42, t47.t48, t51.t52, t55.t56, t59.t60, t65.t66, t69.t70, t74.t75, t78.t79, t82...525
Computing Next relation with stutter on 2.93367e+25 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:56:12] [INFO ] Flatten gal took : 12 ms
[2025-06-01 12:56:12] [INFO ] Applying decomposition
[2025-06-01 12:56:12] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10767365100601206297.txt' '-o' '/tmp/graph10767365100601206297.bin' '-w' '/tmp/graph10767365100601206297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10767365100601206297.bin' '-l' '-1' '-v' '-w' '/tmp/graph10767365100601206297.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:56:13] [INFO ] Decomposing Gal with order
[2025-06-01 12:56:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:56:13] [INFO ] Removed a total of 319 redundant transitions.
[2025-06-01 12:56:13] [INFO ] Flatten gal took : 26 ms
[2025-06-01 12:56:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 11 ms.
[2025-06-01 12:56:13] [INFO ] Time to serialize gal into /tmp/LTL3173892336569917002.gal : 3 ms
[2025-06-01 12:56:13] [INFO ] Time to serialize properties into /tmp/LTL8812471418580190054.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3173892336569917002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8812471418580190054.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(gu158.rcv_left_election_35_2_3_3<=gu158.election_35_6_21_to_left_15)")))&&(F("(gu26.election_35_5_28_to_right_27<=gu26.rcv...186
Formula 0 simplified : F(GF!"(gu158.rcv_left_election_35_2_3_3<=gu158.election_35_6_21_to_left_15)" | G!"(gu26.election_35_5_28_to_right_27<=gu26.rcv_left_...176
Reverse transition relation is NOT exact ! Due to transitions gi2.gi0.gi1.t184_t185, gi2.gi0.gi3.t764_t765, gi2.gi0.gi3.t37_t38, gi2.gi0.t370_t371, gi2.gi0...899
Computing Next relation with stutter on 2.93367e+25 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-01 finished in 295765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(p1)||G(p0)))))'
Support contains 3 out of 913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 913/913 places, 871/871 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 912 transition count 871
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 900 transition count 859
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 900 transition count 859
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 893 transition count 852
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 893 transition count 852
Applied a total of 39 rules in 112 ms. Remains 893 /913 variables (removed 20) and now considering 852/871 (removed 19) transitions.
// Phase 1: matrix 852 rows 893 cols
[2025-06-01 12:56:28] [INFO ] Computed 41 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:56:28] [INFO ] Implicit Places using invariants in 444 ms returned []
[2025-06-01 12:56:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:56:39] [INFO ] Implicit Places using invariants and state equation in 10544 ms returned []
Implicit Place search using SMT with State Equation took 10991 ms to find 0 implicit places.
Running 817 sub problems to find dead transitions.
[2025-06-01 12:56:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
(s551 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 672)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 669)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 667)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 664)
(s25 1)
(s26 0)
(s27 1)
(s28 662)
(s29 1)
(s30 662)
(s31 1)
(s32 662)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 660)
(s38 0)
(s39 1)
(s40 656)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 655)
(s46 0)
(s47 654)
(s48 0)
(s49 653)
(s50 651)
(s51 1)
(s52 649)
(s53 1)
(s54 0)
(s55 648)
(s56 0)
(s57 1)
(s58 645)
(s59 1)
(s60 0)
(s61 644)
(s62 642)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 640)
(s68 0)
(s69 1)
(s70 1)
(s71 674)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 672)
(s78 1)
(s79 673)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 671)
(s86 1)
(s87 671)
(s88 1)
(s89 670)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 669)
(s104 1)
(s105 1)
(s106 1)
(s107 669)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 667)
(s116 1)
(s117 1)
(s118 1)
(s119 666)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 664)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 662)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 658)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 656)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 647)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 642)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Starting structural reductions in LTL mode, iteration 1 : 893/913 places, 852/871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71307 ms. Remains : 893/913 places, 852/871 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 371 ms.
Product exploration explored 100000 steps with 33333 reset in 388 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 12 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-03 finished in 72538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U X(p0))))||G(!p0)))'
Support contains 2 out of 913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 913/913 places, 871/871 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 912 transition count 871
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 901 transition count 860
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 901 transition count 860
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 895 transition count 854
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 895 transition count 854
Applied a total of 35 rules in 109 ms. Remains 895 /913 variables (removed 18) and now considering 854/871 (removed 17) transitions.
// Phase 1: matrix 854 rows 895 cols
[2025-06-01 12:57:40] [INFO ] Computed 41 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:57:41] [INFO ] Implicit Places using invariants in 437 ms returned []
[2025-06-01 12:57:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:57:51] [INFO ] Implicit Places using invariants and state equation in 10201 ms returned []
Implicit Place search using SMT with State Equation took 10646 ms to find 0 implicit places.
Running 819 sub problems to find dead transitions.
[2025-06-01 12:57:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/860 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/860 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 2 (OVERLAPS) 35/895 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 819 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 895/1749 variables, and 41 constraints, problems are : Problem set: 0 solved, 819 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/895 constraints, PredecessorRefiner: 819/819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 819 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/860 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/860 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 2 (OVERLAPS) 35/895 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 819 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 895/1749 variables, and 41 constraints, problems are : Problem set: 0 solved, 819 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/895 constraints, PredecessorRefiner: 0/819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 819 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 895/913 places, 854/871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70922 ms. Remains : 895/913 places, 854/871 transitions.
Stuttering acceptance computed with spot in 388 ms :[false, false, (NOT p0), (NOT p0), (NOT p0), false, true, (NOT p0), false, p0]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 860 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-08 finished in 71337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1||F(p0))))))'
Support contains 4 out of 913 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 913/913 places, 871/871 transitions.
Graph (complete) has 1742 edges and 913 vertex of which 912 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 34 places and 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 388 place count 878 transition count 450
Reduce places removed 387 places and 0 transitions.
Iterating post reduction 1 with 387 rules applied. Total rules applied 775 place count 491 transition count 450
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 786 place count 480 transition count 439
Iterating global reduction 2 with 11 rules applied. Total rules applied 797 place count 480 transition count 439
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 802 place count 480 transition count 434
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 807 place count 475 transition count 434
Applied a total of 807 rules in 58 ms. Remains 475 /913 variables (removed 438) and now considering 434/871 (removed 437) transitions.
// Phase 1: matrix 434 rows 475 cols
[2025-06-01 12:58:52] [INFO ] Computed 41 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:58:52] [INFO ] Implicit Places using invariants in 607 ms returned []
[2025-06-01 12:58:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:58:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 12:59:06] [INFO ] Implicit Places using invariants and state equation in 13388 ms returned []
Implicit Place search using SMT with State Equation took 13997 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:59:06] [INFO ] Redundant transitions in 3 ms returned []
Running 368 sub problems to find dead transitions.
[2025-06-01 12:59:06] [INFO ] Invariant cache hit.
[2025-06-01 12:59:06] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 3/412 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 373/785 variables, 412/453 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/785 variables, 10/463 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 785/909 variables, and 463 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 412/475 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 3/412 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 373/785 variables, 412/453 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/785 variables, 10/463 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/785 variables, 368/831 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 785/909 variables, and 831 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 412/475 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in SI_LTL mode, iteration 1 : 475/913 places, 434/871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74139 ms. Remains : 475/913 places, 434/871 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-09
Product exploration explored 100000 steps with 3934 reset in 667 ms.
Product exploration explored 100000 steps with 3864 reset in 686 ms.
Computed a total of 475 stabilizing places and 434 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 475 transition count 434
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 12 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-09 finished in 75752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(p1) U X(X(p2)))&&X((p2&&X(p0))))))'
Support contains 5 out of 913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 913/913 places, 871/871 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 912 transition count 871
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 901 transition count 860
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 901 transition count 860
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 894 transition count 853
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 894 transition count 853
Applied a total of 37 rules in 106 ms. Remains 894 /913 variables (removed 19) and now considering 853/871 (removed 18) transitions.
// Phase 1: matrix 853 rows 894 cols
[2025-06-01 13:00:07] [INFO ] Computed 41 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:00:08] [INFO ] Implicit Places using invariants in 426 ms returned []
[2025-06-01 13:00:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:00:18] [INFO ] Implicit Places using invariants and state equation in 10281 ms returned []
Implicit Place search using SMT with State Equation took 10710 ms to find 0 implicit places.
Running 818 sub problems to find dead transitions.
[2025-06-01 13:00:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/859 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/859 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 2 (OVERLAPS) 35/894 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 818 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 894/1747 variables, and 41 constraints, problems are : Problem set: 0 solved, 818 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/894 constraints, PredecessorRefiner: 818/818 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 818 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/859 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/859 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 2 (OVERLAPS) 35/894 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 818 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 672)
(s1 1)
(s2 0)
(s3 1)
(s4 671)
(s5 1)
(s6 0)
(s7 671)
(s8 0)
(s9 671)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 666)
(s21 1)
(s22 0)
(s23 666)
(s24 664)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 662)
(s31 1)
(s32 662)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 658)
(s40 656)
(s41 1)
(s42 0)
(s43 656)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 653)
(s50 0)
(s51 652)
(s52 649)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 643)
(s61 1)
(s62 0)
(s63 643)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 1)
(s71 674)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 673)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 670)
(s96 1)
(s97 669)
(s98 1)
(s99 669)
(s100 1)
(s101 669)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 668)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 664)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 663)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 662)
(s145 1)
(s146 1)
(s147 1)
(s148 660)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 655)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 654)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 648)
(s185 1)
(s186 646)
(s187 1)
(s188 647)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 642)
(s199 1)
(s200 1)
(s201 1)
(s202 640)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 894/1747 variables, and 41 constraints, problems are : Problem set: 0 solved, 818 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/894 constraints, PredecessorRefiner: 0/818 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 818 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 894/913 places, 853/871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70996 ms. Remains : 894/913 places, 853/871 transitions.
Stuttering acceptance computed with spot in 535 ms :[(OR (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-10
Stuttering criterion allowed to conclude after 7321 steps with 11 reset in 31 ms.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-10 finished in 71592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 913 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 913/913 places, 871/871 transitions.
Graph (complete) has 1742 edges and 913 vertex of which 912 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 35 places and 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 390 place count 877 transition count 447
Reduce places removed 389 places and 0 transitions.
Iterating post reduction 1 with 389 rules applied. Total rules applied 779 place count 488 transition count 447
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 791 place count 476 transition count 435
Iterating global reduction 2 with 12 rules applied. Total rules applied 803 place count 476 transition count 435
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 5 rules applied. Total rules applied 808 place count 476 transition count 430
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 813 place count 471 transition count 430
Applied a total of 813 rules in 44 ms. Remains 471 /913 variables (removed 442) and now considering 430/871 (removed 441) transitions.
// Phase 1: matrix 430 rows 471 cols
[2025-06-01 13:01:19] [INFO ] Computed 41 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:01:20] [INFO ] Implicit Places using invariants in 619 ms returned []
[2025-06-01 13:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:01:31] [INFO ] Implicit Places using invariants and state equation in 11088 ms returned []
Implicit Place search using SMT with State Equation took 11711 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:01:31] [INFO ] Redundant transitions in 2 ms returned []
Running 361 sub problems to find dead transitions.
[2025-06-01 13:01:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 2/404 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 363/767 variables, 404/445 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/901 variables, and 445 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 404/471 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 2/404 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 363/767 variables, 404/445 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 361/806 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/901 variables, and 806 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 404/471 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in SI_LTL mode, iteration 1 : 471/913 places, 430/871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71834 ms. Remains : 471/913 places, 430/871 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-11
Stuttering criterion allowed to conclude after 461 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-11 finished in 71902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))||X(p1)))'
Support contains 4 out of 913 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 913/913 places, 871/871 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 912 transition count 871
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 900 transition count 859
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 900 transition count 859
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 893 transition count 852
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 893 transition count 852
Applied a total of 39 rules in 105 ms. Remains 893 /913 variables (removed 20) and now considering 852/871 (removed 19) transitions.
// Phase 1: matrix 852 rows 893 cols
[2025-06-01 13:02:31] [INFO ] Computed 41 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:02:31] [INFO ] Implicit Places using invariants in 401 ms returned []
[2025-06-01 13:02:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:02:42] [INFO ] Implicit Places using invariants and state equation in 10416 ms returned []
Implicit Place search using SMT with State Equation took 10820 ms to find 0 implicit places.
Running 817 sub problems to find dead transitions.
[2025-06-01 13:02:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 893/913 places, 852/871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71095 ms. Remains : 893/913 places, 852/871 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 384 ms.
Product exploration explored 100000 steps with 50000 reset in 406 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 11 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-12 finished in 72297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 913 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 913/913 places, 871/871 transitions.
Graph (complete) has 1742 edges and 913 vertex of which 912 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 35 places and 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 389 place count 877 transition count 448
Reduce places removed 388 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 389 rules applied. Total rules applied 778 place count 489 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 779 place count 488 transition count 447
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 791 place count 476 transition count 435
Iterating global reduction 3 with 12 rules applied. Total rules applied 803 place count 476 transition count 435
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 808 place count 476 transition count 430
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 813 place count 471 transition count 430
Applied a total of 813 rules in 47 ms. Remains 471 /913 variables (removed 442) and now considering 430/871 (removed 441) transitions.
// Phase 1: matrix 430 rows 471 cols
[2025-06-01 13:03:43] [INFO ] Computed 41 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:03:44] [INFO ] Implicit Places using invariants in 589 ms returned []
[2025-06-01 13:03:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:03:55] [INFO ] Implicit Places using invariants and state equation in 11655 ms returned []
Implicit Place search using SMT with State Equation took 12246 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:03:55] [INFO ] Redundant transitions in 2 ms returned []
Running 361 sub problems to find dead transitions.
[2025-06-01 13:03:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 2/404 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 363/767 variables, 404/445 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/901 variables, and 445 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 404/471 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 2/404 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 363/767 variables, 404/445 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 361/806 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/901 variables, and 806 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 404/471 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in SI_LTL mode, iteration 1 : 471/913 places, 430/871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72360 ms. Remains : 471/913 places, 430/871 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-13
Stuttering criterion allowed to conclude after 465 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-13 finished in 72422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p0 U (p1||G(p0)))))))'
Support contains 2 out of 913 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 913/913 places, 871/871 transitions.
Graph (complete) has 1742 edges and 913 vertex of which 912 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 35 places and 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 388 place count 877 transition count 449
Reduce places removed 387 places and 0 transitions.
Iterating post reduction 1 with 387 rules applied. Total rules applied 775 place count 490 transition count 449
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 785 place count 480 transition count 439
Iterating global reduction 2 with 10 rules applied. Total rules applied 795 place count 480 transition count 439
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 799 place count 480 transition count 435
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 803 place count 476 transition count 435
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 805 place count 475 transition count 434
Applied a total of 805 rules in 61 ms. Remains 475 /913 variables (removed 438) and now considering 434/871 (removed 437) transitions.
// Phase 1: matrix 434 rows 475 cols
[2025-06-01 13:04:56] [INFO ] Computed 41 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:04:56] [INFO ] Implicit Places using invariants in 575 ms returned []
[2025-06-01 13:04:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:05:08] [INFO ] Implicit Places using invariants and state equation in 11464 ms returned []
Implicit Place search using SMT with State Equation took 12042 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:05:08] [INFO ] Redundant transitions in 5 ms returned []
Running 365 sub problems to find dead transitions.
[2025-06-01 13:05:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 370/778 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 778/909 variables, and 449 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 370/778 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/778 variables, 365/814 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 778/909 variables, and 814 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in SI_LTL mode, iteration 1 : 475/913 places, 434/871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72167 ms. Remains : 475/913 places, 434/871 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-15
Stuttering criterion allowed to conclude after 458 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-15 finished in 72231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(X(F(p1)))))))'
Found a Shortening insensitive property : HirschbergSinclair-PT-35-LTLCardinality-00
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 913 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 913/913 places, 871/871 transitions.
Graph (complete) has 1742 edges and 913 vertex of which 912 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 35 places and 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 386 transitions
Trivial Post-agglo rules discarded 386 transitions
Performed 386 trivial Post agglomeration. Transition count delta: 386
Iterating post reduction 0 with 386 rules applied. Total rules applied 387 place count 877 transition count 450
Reduce places removed 386 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 387 rules applied. Total rules applied 774 place count 491 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 775 place count 490 transition count 449
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 785 place count 480 transition count 439
Iterating global reduction 3 with 10 rules applied. Total rules applied 795 place count 480 transition count 439
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 800 place count 480 transition count 434
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 805 place count 475 transition count 434
Applied a total of 805 rules in 42 ms. Remains 475 /913 variables (removed 438) and now considering 434/871 (removed 437) transitions.
// Phase 1: matrix 434 rows 475 cols
[2025-06-01 13:06:08] [INFO ] Computed 41 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:06:09] [INFO ] Implicit Places using invariants in 601 ms returned []
[2025-06-01 13:06:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:06:21] [INFO ] Implicit Places using invariants and state equation in 12636 ms returned []
Implicit Place search using SMT with State Equation took 13239 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-01 13:06:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/777 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/909 variables, and 449 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/777 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 365/814 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/909 variables, and 814 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in LI_LTL mode, iteration 1 : 475/913 places, 434/871 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 73337 ms. Remains : 475/913 places, 434/871 transitions.
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-00
Product exploration explored 100000 steps with 295 reset in 268 ms.
Product exploration explored 100000 steps with 296 reset in 288 ms.
Computed a total of 475 stabilizing places and 434 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 475 transition count 434
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 127 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1867 steps (0 resets) in 19 ms. (93 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-01 13:07:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:07:26] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 2897 ms returned sat
[2025-06-01 13:07:38] [INFO ] [Real]Absence check using state equation in 11864 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2025-06-01 13:07:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:07:39] [INFO ] Implicit Places using invariants in 599 ms returned []
[2025-06-01 13:07:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:07:51] [INFO ] Implicit Places using invariants and state equation in 12496 ms returned []
Implicit Place search using SMT with State Equation took 13100 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-01 13:07:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/777 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/909 variables, and 449 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/777 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 365/814 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/909 variables, and 814 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Finished structural reductions in LTL mode , in 1 iterations and 73171 ms. Remains : 475/475 places, 434/434 transitions.
Computed a total of 475 stabilizing places and 434 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 475 transition count 434
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1882 steps (0 resets) in 16 ms. (110 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-01 13:08:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:08:55] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 2931 ms returned sat
[2025-06-01 13:09:07] [INFO ] [Real]Absence check using state equation in 11832 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 295 reset in 276 ms.
Product exploration explored 100000 steps with 296 reset in 293 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 434/434 transitions.
Applied a total of 0 rules in 18 ms. Remains 475 /475 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:09:08] [INFO ] Redundant transitions in 2 ms returned []
Running 365 sub problems to find dead transitions.
[2025-06-01 13:09:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/777 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s40 1.0)
(s41 0.0)
(s100 1.0)
(s101 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/909 variables, and 449 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/777 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 365/814 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/909 variables, and 814 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60086 ms. Remains : 475/475 places, 434/434 transitions.
Built C files in :
/tmp/ltsmin9637963562254156694
[2025-06-01 13:10:08] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9637963562254156694
Running compilation step : cd /tmp/ltsmin9637963562254156694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 685 ms.
Running link step : cd /tmp/ltsmin9637963562254156694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9637963562254156694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18164872254607649056.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 434/434 transitions.
Applied a total of 0 rules in 16 ms. Remains 475 /475 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2025-06-01 13:10:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:10:24] [INFO ] Implicit Places using invariants in 594 ms returned []
[2025-06-01 13:10:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:10:36] [INFO ] Implicit Places using invariants and state equation in 12592 ms returned []
Implicit Place search using SMT with State Equation took 13187 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-01 13:10:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/777 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "ParserException while parsing response: ((t4 1.0)
(t5 0.0)
(t6 0.0)
(t64 1.0)
(t65 0.0)
(t66 0.0)
(t71 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/909 variables, and 449 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 369/777 variables, 408/449 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/777 variables, 365/814 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/909 variables, and 814 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 408/475 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Finished structural reductions in LTL mode , in 1 iterations and 73280 ms. Remains : 475/475 places, 434/434 transitions.
Built C files in :
/tmp/ltsmin13461723625054295229
[2025-06-01 13:11:36] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13461723625054295229
Running compilation step : cd /tmp/ltsmin13461723625054295229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 674 ms.
Running link step : cd /tmp/ltsmin13461723625054295229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13461723625054295229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11038102833389805167.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 13:11:52] [INFO ] Flatten gal took : 10 ms
[2025-06-01 13:11:52] [INFO ] Flatten gal took : 12 ms
[2025-06-01 13:11:52] [INFO ] Time to serialize gal into /tmp/LTL764192721163031294.gal : 3 ms
[2025-06-01 13:11:52] [INFO ] Time to serialize properties into /tmp/LTL12561607896355712381.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL764192721163031294.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14383596982265330904.hoa' '-atoms' '/tmp/LTL12561607896355712381.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12561607896355712381.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14383596982265330904.hoa
Reverse transition relation is NOT exact ! Due to transitions t37.t38, t46, t47.t48, t51.t52, t55.t56, t59.t60, t65.t66, t69.t70, t74.t75, t78.t79, t82.t83...510
Computing Next relation with stutter on 3.5204e+25 deadlock states
Detected timeout of ITS tools.
[2025-06-01 13:12:07] [INFO ] Flatten gal took : 10 ms
[2025-06-01 13:12:07] [INFO ] Flatten gal took : 10 ms
[2025-06-01 13:12:07] [INFO ] Time to serialize gal into /tmp/LTL4521206414230151654.gal : 2 ms
[2025-06-01 13:12:07] [INFO ] Time to serialize properties into /tmp/LTL14904382614188413317.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4521206414230151654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14904382614188413317.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(elected_35_to_left_12>rcv_left_reply_32_0_32)")||(X(X(X(F("(reply_35_5_to_left_12>rcv_left_reply_3_0_3)"))))))))
Formula 0 simplified : G(!"(elected_35_to_left_12>rcv_left_reply_32_0_32)" & XXXG!"(reply_35_5_to_left_12>rcv_left_reply_3_0_3)")
Reverse transition relation is NOT exact ! Due to transitions t37.t38, t46, t47.t48, t51.t52, t55.t56, t59.t60, t65.t66, t69.t70, t74.t75, t78.t79, t82.t83...510
Computing Next relation with stutter on 3.5204e+25 deadlock states
Detected timeout of ITS tools.
[2025-06-01 13:12:22] [INFO ] Flatten gal took : 14 ms
[2025-06-01 13:12:22] [INFO ] Applying decomposition
[2025-06-01 13:12:22] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18106722329653825945.txt' '-o' '/tmp/graph18106722329653825945.bin' '-w' '/tmp/graph18106722329653825945.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18106722329653825945.bin' '-l' '-1' '-v' '-w' '/tmp/graph18106722329653825945.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:12:22] [INFO ] Decomposing Gal with order
[2025-06-01 13:12:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:12:22] [INFO ] Removed a total of 316 redundant transitions.
[2025-06-01 13:12:22] [INFO ] Flatten gal took : 24 ms
[2025-06-01 13:12:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 14 ms.
[2025-06-01 13:12:22] [INFO ] Time to serialize gal into /tmp/LTL11606529995623843321.gal : 5 ms
[2025-06-01 13:12:22] [INFO ] Time to serialize properties into /tmp/LTL17876489589354060329.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11606529995623843321.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17876489589354060329.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(gu35.elected_35_to_left_12>gu35.rcv_left_reply_32_0_32)")||(X(X(X(F("(gu4.reply_35_5_to_left_12>gu4.rcv_left_reply_3_0_3)"))))...159
Formula 0 simplified : G(!"(gu35.elected_35_to_left_12>gu35.rcv_left_reply_32_0_32)" & XXXG!"(gu4.reply_35_5_to_left_12>gu4.rcv_left_reply_3_0_3)")
Reverse transition relation is NOT exact ! Due to transitions gi5.gi0.gi0.gi1.t180_t181, gi5.gi0.gi0.t828_t829, gi5.gi0.gi0.t184_t185, gi5.gi0.gi0.t164_t16...890
Computing Next relation with stutter on 3.5204e+25 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-00 finished in 389251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
[2025-06-01 13:12:37] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
[2025-06-01 13:12:37] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin17751327086448482944
[2025-06-01 13:12:37] [INFO ] Computing symmetric may disable matrix : 871 transitions.
[2025-06-01 13:12:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:12:37] [INFO ] Computing symmetric may enable matrix : 871 transitions.
[2025-06-01 13:12:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:12:37] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph632055843672354690.txt' '-o' '/tmp/graph632055843672354690.bin' '-w' '/tmp/graph632055843672354690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph632055843672354690.bin' '-l' '-1' '-v' '-w' '/tmp/graph632055843672354690.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:12:37] [INFO ] Decomposing Gal with order
[2025-06-01 13:12:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:12:37] [INFO ] Computing Do-Not-Accords matrix : 871 transitions.
[2025-06-01 13:12:37] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:12:37] [INFO ] Built C files in 233ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17751327086448482944
Running compilation step : cd /tmp/ltsmin17751327086448482944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-01 13:12:37] [INFO ] Removed a total of 89 redundant transitions.
[2025-06-01 13:12:38] [INFO ] Flatten gal took : 76 ms
[2025-06-01 13:12:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-01 13:12:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality15095062932214091035.gal : 7 ms
[2025-06-01 13:12:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality1692711906849733712.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15095062932214091035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1692711906849733712.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F(("(gu93.elected_35_to_left_12>gu93.rcv_left_reply_32_0_32)")||(X(X(X(F("(gu72.reply_35_5_to_left_12>gu72.rcv_left_reply_3_0_3)"))...161
Formula 0 simplified : G(!"(gu93.elected_35_to_left_12>gu93.rcv_left_reply_32_0_32)" & XXXG!"(gu72.reply_35_5_to_left_12>gu72.rcv_left_reply_3_0_3)")
Compilation finished in 2596 ms.
Running link step : cd /tmp/ltsmin17751327086448482944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin17751327086448482944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)||X(X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gi0.gi0.gu2.t42, gi0.gi0.gi0.gi0.gu3.t48, gi0.gi0.gi0.gi0.gu4.t52, gi0.gi0.gi0.gi0.gu...2345
Computing Next relation with stutter on 2.17974e+26 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17751327086448482944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)||X(X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17751327086448482944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>([]((LTLAPp2==true)))&&<>((LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-01 13:42:17] [INFO ] Flatten gal took : 79 ms
[2025-06-01 13:42:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality15229360101712665042.gal : 12 ms
[2025-06-01 13:42:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality3928155768621848947.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15229360101712665042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3928155768621848947.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F(("(elected_35_to_left_12>rcv_left_reply_32_0_32)")||(X(X(X(F("(reply_35_5_to_left_12>rcv_left_reply_3_0_3)"))))))))
Formula 0 simplified : G(!"(elected_35_to_left_12>rcv_left_reply_32_0_32)" & XXXG!"(reply_35_5_to_left_12>rcv_left_reply_3_0_3)")
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17751327086448482944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>([]((LTLAPp2==true)))&&<>((LTLAPp3==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin17751327086448482944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)||X(X(X(<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-35"
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-5832"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-35, 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 r114-tall-174876422100107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-35.tgz
mv HirschbergSinclair-PT-35 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.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 '
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 ;