About the Execution of ITS-Tools for ShieldPPPt-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 825473.00 | 0.00 | 0.00 | FFFFFFFFTFTFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533600923.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 ShieldPPPt-PT-050A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533600923
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K 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 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 337K May 29 14:33 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 ShieldPPPt-PT-050A-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-050A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749332201297
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 21:36:42] [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-07 21:36:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 21:36:42] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2025-06-07 21:36:42] [INFO ] Transformed 1253 places.
[2025-06-07 21:36:42] [INFO ] Transformed 903 transitions.
[2025-06-07 21:36:42] [INFO ] Found NUPN structural information;
[2025-06-07 21:36:42] [INFO ] Parsed PT model containing 1253 places and 903 transitions and 3606 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050A-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 132 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2025-06-07 21:36:43] [INFO ] Computed 551 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:36:43] [INFO ] Implicit Places using invariants in 943 ms returned []
[2025-06-07 21:36:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:36:45] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2025-06-07 21:36:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 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 1252/2155 variables, and 1252 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30045 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 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 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30023 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60469ms
Finished structural reductions in LTL mode , in 1 iterations and 62797 ms. Remains : 1253/1253 places, 902/902 transitions.
Support contains 37 out of 1253 places after structural reductions.
[2025-06-07 21:37:45] [INFO ] Flatten gal took : 162 ms
[2025-06-07 21:37:46] [INFO ] Flatten gal took : 80 ms
[2025-06-07 21:37:46] [INFO ] Input system was already deterministic with 902 transitions.
Reduction of identical properties reduced properties to check from 22 to 20
RANDOM walk for 40000 steps (8 resets) in 2231 ms. (17 steps per ms) remains 12/20 properties
BEST_FIRST walk for 40003 steps (8 resets) in 445 ms. (89 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 456 ms. (87 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 366 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 372 ms. (107 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 349 ms. (114 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 261 ms. (152 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 303 ms. (131 steps per ms) remains 12/12 properties
[2025-06-07 21:37:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 43/64 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 43/88 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1189/1253 variables, 527/615 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1189/1804 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 902/2155 variables, 1253/3057 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2155 variables, 0/3057 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/2155 variables, 0/3057 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2155/2155 variables, and 3057 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1835 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 43/64 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 43/88 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1189/1253 variables, 527/615 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1189/1804 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 902/2155 variables, 1253/3057 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2155 variables, 12/3069 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2155 variables, 0/3069 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/2155 variables, 0/3069 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2155/2155 variables, and 3069 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4685 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6536ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 11 properties in 17974 ms.
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 900
Partial Free-agglomeration rule applied 198 times.
Drop transitions (Partial Free agglomeration) removed 198 transitions
Iterating global reduction 0 with 198 rules applied. Total rules applied 202 place count 1251 transition count 900
Applied a total of 202 rules in 272 ms. Remains 1251 /1253 variables (removed 2) and now considering 900/902 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 1251/1253 places, 900/902 transitions.
RANDOM walk for 40000 steps (8 resets) in 615 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 239848 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 239848 steps, saw 233339 distinct states, run finished after 3006 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 900 rows 1251 cols
[2025-06-07 21:38:16] [INFO ] Computed 551 invariants in 6 ms
[2025-06-07 21:38:16] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1240/1251 variables, 547/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1251 variables, 1240/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1251 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 900/2151 variables, 1251/3053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2151 variables, 52/3105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2151 variables, 0/3105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2151 variables, 0/3105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2151/2151 variables, and 3105 constraints, problems are : Problem set: 0 solved, 1 unsolved in 616 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1251/1251 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1240/1251 variables, 547/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1251 variables, 1240/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1251 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 900/2151 variables, 1251/3053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2151 variables, 52/3105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2151 variables, 1/3106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2151 variables, 0/3106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2151 variables, 0/3106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2151/2151 variables, and 3106 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1231 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1251/1251 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1870ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18772 steps, including 180 resets, run visited all 1 properties in 209 ms. (steps per millisecond=89 )
Parikh walk visited 1 properties in 211 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
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) U G(p1))&&((p0 U p2) U X(p3))))'
Support contains 8 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 16 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2025-06-07 21:38:18] [INFO ] Computed 551 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:38:19] [INFO ] Implicit Places using invariants in 611 ms returned []
[2025-06-07 21:38:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:38:20] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1851 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2025-06-07 21:38:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2155 variables, and 1252 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30024 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30025 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60274ms
Finished structural reductions in LTL mode , in 1 iterations and 62144 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 488 ms :[(OR (NOT p1) (NOT p3)), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-01 finished in 62703 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 U ((F(G(p1))&&F(p2)) U p3)))))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 901
Applied a total of 2 rules in 84 ms. Remains 1252 /1253 variables (removed 1) and now considering 901/902 (removed 1) transitions.
// Phase 1: matrix 901 rows 1252 cols
[2025-06-07 21:39:21] [INFO ] Computed 551 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:39:22] [INFO ] Implicit Places using invariants in 644 ms returned [1245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 646 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/1253 places, 901/902 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1251 transition count 899
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1249 transition count 899
Applied a total of 4 rules in 43 ms. Remains 1249 /1251 variables (removed 2) and now considering 899/901 (removed 2) transitions.
// Phase 1: matrix 899 rows 1249 cols
[2025-06-07 21:39:22] [INFO ] Computed 550 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:39:22] [INFO ] Implicit Places using invariants in 610 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 612 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1247/1253 places, 899/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 897
Applied a total of 4 rules in 45 ms. Remains 1245 /1247 variables (removed 2) and now considering 897/899 (removed 2) transitions.
// Phase 1: matrix 897 rows 1245 cols
[2025-06-07 21:39:22] [INFO ] Computed 548 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:39:23] [INFO ] Implicit Places using invariants in 609 ms returned []
[2025-06-07 21:39:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:39:24] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1245/1253 places, 897/902 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3224 ms. Remains : 1245/1253 places, 897/902 transitions.
Stuttering acceptance computed with spot in 315 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 834 ms.
Product exploration explored 100000 steps with 0 reset in 985 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X p3), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (OR (AND p3 p1) (AND p1 p0)))), (X (OR (AND p3 (NOT p1)) (AND (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p3 p1) (AND p1 p0))))), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 147 ms. Reduced automaton from 7 states, 29 edges and 4 AP (stutter insensitive) to 7 states, 29 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 857 ms. (46 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 117243 steps, run timeout after 3002 ms. (steps per millisecond=39 ) properties seen :9 out of 17
Probabilistic random walk after 117243 steps, saw 115884 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :9
[2025-06-07 21:39:30] [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/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 13/19 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1226/1245 variables, 541/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1245 variables, 1226/1793 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1245 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 897/2142 variables, 1245/3038 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2142 variables, 0/3038 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/2142 variables, 0/3038 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2142/2142 variables, and 3038 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1064 ms.
Refiners :[Domain max(s): 1245/1245 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1245/1245 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 13/19 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1226/1245 variables, 541/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1245 variables, 1226/1793 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1245 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 897/2142 variables, 1245/3038 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2142 variables, 8/3046 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2142 variables, 0/3046 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/2142 variables, 0/3046 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2142/2142 variables, and 3046 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3428 ms.
Refiners :[Domain max(s): 1245/1245 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1245/1245 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4508ms problems are : Problem set: 0 solved, 8 unsolved
Finished Parikh walk after 82792 steps, including 748 resets, run visited all 8 properties in 1123 ms. (steps per millisecond=73 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 1127 ms.
Knowledge obtained : [(AND p3 p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X p3), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) p1 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (OR (AND p3 p1) (AND p1 p0)))), (X (OR (AND p3 (NOT p1)) (AND (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p3 p1) (AND p1 p0))))), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR p1 p3 p0))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR p3 p2))), (F (NOT (OR p3 p0))), (F (NOT (OR p3 p0 p2))), (F (NOT p0)), (F (NOT (OR (NOT p1) p3 (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p3)) (OR (NOT p1) (NOT p0))))), (F (NOT (OR p1 p3 (NOT p0)))), (F (NOT (AND (OR (NOT p3) p2) (OR (NOT p0) p2)))), (F (NOT (OR p3 (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p3 (NOT p0)))), (F p1), (F (NOT p3)), (F (NOT (OR (NOT p1) p3 p0))), (F (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p0))))]
Knowledge based reduction with 33 factoid took 712 ms. Reduced automaton from 7 states, 29 edges and 4 AP (stutter insensitive) to 7 states, 29 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 318 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 330 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3)]
Support contains 6 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1245/1245 places, 897/897 transitions.
Applied a total of 0 rules in 28 ms. Remains 1245 /1245 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2025-06-07 21:39:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:39:38] [INFO ] Implicit Places using invariants in 617 ms returned []
[2025-06-07 21:39:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:39:39] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 21:39:39] [INFO ] Redundant transitions in 51 ms returned []
Running 896 sub problems to find dead transitions.
[2025-06-07 21:39: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/1244 variables, 1244/1244 constraints. Problems are: Problem set: 0 solved, 896 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 1244/2142 variables, and 1244 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30027 ms.
Refiners :[Domain max(s): 1244/1245 constraints, Positive P Invariants (semi-flows): 0/548 constraints, State Equation: 0/1245 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 896 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1244 variables, 1244/1244 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1244 variables, 0/1244 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (OVERLAPS) 1/1245 variables, 548/1792 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1245 variables, 1/1793 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/2142 variables, and 1793 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30020 ms.
Refiners :[Domain max(s): 1245/1245 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1245 constraints, PredecessorRefiner: 0/896 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60280ms problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62154 ms. Remains : 1245/1245 places, 897/897 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 p0 p2 (NOT p1)), (X p2), (X p3), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR (AND (NOT p1) p3) (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (OR (AND p1 p3) (AND p1 p0)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (OR (AND p1 p3) (AND p1 p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 147 ms. Reduced automaton from 7 states, 29 edges and 4 AP (stutter insensitive) to 7 states, 29 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 324 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 600 ms. (66 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 108629 steps, run timeout after 3002 ms. (steps per millisecond=36 ) properties seen :9 out of 17
Probabilistic random walk after 108629 steps, saw 107405 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :9
[2025-06-07 21:40:43] [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/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 13/19 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1226/1245 variables, 541/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1245 variables, 1226/1793 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1245 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 897/2142 variables, 1245/3038 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2142 variables, 0/3038 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/2142 variables, 0/3038 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2142/2142 variables, and 3038 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1058 ms.
Refiners :[Domain max(s): 1245/1245 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1245/1245 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 13/19 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1226/1245 variables, 541/567 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1245 variables, 1226/1793 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1245 variables, 0/1793 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 897/2142 variables, 1245/3038 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2142 variables, 8/3046 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2142 variables, 0/3046 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/2142 variables, 0/3046 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2142/2142 variables, and 3046 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3426 ms.
Refiners :[Domain max(s): 1245/1245 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1245/1245 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4498ms problems are : Problem set: 0 solved, 8 unsolved
Finished Parikh walk after 35934 steps, including 60 resets, run visited all 1 properties in 364 ms. (steps per millisecond=98 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 5916 ms.
Knowledge obtained : [(AND p3 p0 p2 (NOT p1)), (X p2), (X p3), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR (AND (NOT p1) p3) (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (OR (AND p1 p3) (AND p1 p0)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (OR (AND p1 p3) (AND p1 p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR p1 p3 p0))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR p3 p2))), (F (NOT (OR p3 p0))), (F (NOT (OR p3 p0 p2))), (F (NOT p0)), (F (NOT (OR (NOT p1) p3 (NOT p0)))), (F (NOT (AND (OR (NOT p1) (NOT p3)) (OR (NOT p1) (NOT p0))))), (F (NOT (OR p1 p3 (NOT p0)))), (F (NOT (AND (OR (NOT p3) p2) (OR (NOT p0) p2)))), (F (NOT (OR p3 (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p3 (NOT p0)))), (F p1), (F (NOT p3)), (F (NOT (OR (NOT p1) p3 p0))), (F (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p0))))]
Knowledge based reduction with 35 factoid took 754 ms. Reduced automaton from 7 states, 29 edges and 4 AP (stutter insensitive) to 7 states, 29 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 313 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 319 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 330 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 925 ms.
Product exploration explored 100000 steps with 0 reset in 1126 ms.
Built C files in :
/tmp/ltsmin7446847158140713066
[2025-06-07 21:40:57] [INFO ] Computing symmetric may disable matrix : 897 transitions.
[2025-06-07 21:40:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 21:40:57] [INFO ] Computing symmetric may enable matrix : 897 transitions.
[2025-06-07 21:40:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 21:40:58] [INFO ] Computing Do-Not-Accords matrix : 897 transitions.
[2025-06-07 21:40:58] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 21:40:58] [INFO ] Built C files in 209ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7446847158140713066
Running compilation step : cd /tmp/ltsmin7446847158140713066;'/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 2703 ms.
Running link step : cd /tmp/ltsmin7446847158140713066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin7446847158140713066;'/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/stateBased1417297089159305710.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1245/1245 places, 897/897 transitions.
Applied a total of 0 rules in 24 ms. Remains 1245 /1245 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2025-06-07 21:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:41:13] [INFO ] Implicit Places using invariants in 628 ms returned []
[2025-06-07 21:41:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:41:14] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 21:41:14] [INFO ] Redundant transitions in 84 ms returned []
Running 896 sub problems to find dead transitions.
[2025-06-07 21:41:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1244 variables, 1244/1244 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1244/2142 variables, and 1244 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30020 ms.
Refiners :[Domain max(s): 1244/1245 constraints, Positive P Invariants (semi-flows): 0/548 constraints, State Equation: 0/1245 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 896 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1244 variables, 1244/1244 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1244 variables, 0/1244 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (OVERLAPS) 1/1245 variables, 548/1792 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1245 variables, 1/1793 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/2142 variables, and 1793 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30024 ms.
Refiners :[Domain max(s): 1245/1245 constraints, Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 0/1245 constraints, PredecessorRefiner: 0/896 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60313ms problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62268 ms. Remains : 1245/1245 places, 897/897 transitions.
Built C files in :
/tmp/ltsmin8237142555394099106
[2025-06-07 21:42:15] [INFO ] Computing symmetric may disable matrix : 897 transitions.
[2025-06-07 21:42:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 21:42:15] [INFO ] Computing symmetric may enable matrix : 897 transitions.
[2025-06-07 21:42:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 21:42:15] [INFO ] Computing Do-Not-Accords matrix : 897 transitions.
[2025-06-07 21:42:15] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 21:42:15] [INFO ] Built C files in 161ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8237142555394099106
Running compilation step : cd /tmp/ltsmin8237142555394099106;'/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 2693 ms.
Running link step : cd /tmp/ltsmin8237142555394099106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin8237142555394099106;'/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/stateBased18098787994741235176.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 21:42:30] [INFO ] Flatten gal took : 59 ms
[2025-06-07 21:42:30] [INFO ] Flatten gal took : 55 ms
[2025-06-07 21:42:30] [INFO ] Time to serialize gal into /tmp/LTL17702074897003085466.gal : 8 ms
[2025-06-07 21:42:30] [INFO ] Time to serialize properties into /tmp/LTL15931167753712288318.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/LTL17702074897003085466.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12264372798184445237.hoa' '-atoms' '/tmp/LTL15931167753712288318.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...320
Loading property file /tmp/LTL15931167753712288318.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12264372798184445237.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-07 21:42:45] [INFO ] Flatten gal took : 46 ms
[2025-06-07 21:42:45] [INFO ] Flatten gal took : 50 ms
[2025-06-07 21:42:45] [INFO ] Time to serialize gal into /tmp/LTL12823283627831100602.gal : 8 ms
[2025-06-07 21:42:45] [INFO ] Time to serialize properties into /tmp/LTL5720487064261981042.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/LTL12823283627831100602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5720487064261981042.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(G(("((p292==0)||(p28==1))")U(((F(G("(p133==1)")))&&(F("(p668==0)")))U("((p1240==0)||(p203==1))"))))))
Formula 0 simplified : GF(!"((p292==0)||(p28==1))" R ((GF!"(p133==1)" | G!"(p668==0)") R !"((p1240==0)||(p203==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-07 21:43:00] [INFO ] Flatten gal took : 40 ms
[2025-06-07 21:43:00] [INFO ] Applying decomposition
[2025-06-07 21:43:00] [INFO ] Flatten gal took : 40 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/graph17757703995592375340.txt' '-o' '/tmp/graph17757703995592375340.bin' '-w' '/tmp/graph17757703995592375340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17757703995592375340.bin' '-l' '-1' '-v' '-w' '/tmp/graph17757703995592375340.weights' '-q' '0' '-e' '0.001'
[2025-06-07 21:43:00] [INFO ] Decomposing Gal with order
[2025-06-07 21:43:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 21:43:00] [INFO ] Removed a total of 149 redundant transitions.
[2025-06-07 21:43:01] [INFO ] Flatten gal took : 98 ms
[2025-06-07 21:43:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 136 ms.
[2025-06-07 21:43:01] [INFO ] Time to serialize gal into /tmp/LTL12391295713908662857.gal : 15 ms
[2025-06-07 21:43:01] [INFO ] Time to serialize properties into /tmp/LTL2662835684882653934.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/LTL12391295713908662857.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2662835684882653934.ltl' '-c' '-stutter-deadlock'
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...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i4.u92.p292==0)||(i0.u9.p28==1))")U(((F(G("(i2.u42.p133==1)")))&&(F("(i12.u212.p668==0)")))U("((i19.u396.p1240==0)||(i3.u65...172
Formula 0 simplified : GF(!"((i4.u92.p292==0)||(i0.u9.p28==1))" R ((GF!"(i2.u42.p133==1)" | G!"(i12.u212.p668==0)") R !"((i19.u396.p1240==0)||(i3.u65.p203=...162
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-04 finished in 234993 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(F((X(p0)&&F(p1))))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 16 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
// Phase 1: matrix 902 rows 1253 cols
[2025-06-07 21:43:16] [INFO ] Computed 551 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:43:16] [INFO ] Implicit Places using invariants in 633 ms returned []
[2025-06-07 21:43:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:43:18] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned []
Implicit Place search using SMT with State Equation took 1891 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2025-06-07 21:43: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/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2155 variables, and 1252 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30018 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30024 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60317ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60319ms
Finished structural reductions in LTL mode , in 1 iterations and 62228 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 775 ms.
Stack based approach found an accepted trace after 68 steps with 2 reset with depth 61 and stack size 61 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-06 finished in 63225 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((X((F(p1)||G(!p2)))&&p0))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 14 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2025-06-07 21:44:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:44:20] [INFO ] Implicit Places using invariants in 624 ms returned []
[2025-06-07 21:44:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:44:21] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2025-06-07 21:44: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/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 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 1252/2155 variables, and 1252 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30017 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
(s1088 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 1)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 1)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 1)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 1)
(s147 1)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 0)
(s171 1)
(s172 1)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 1)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 1)
(s195 0)
(s196 1)
(s197 1)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 1)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 1)
(s220 0)
(s221 1)
(s222 1)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s244 1)
(s245 0)
(s246 1)
(s247 1)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 1)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 1)
(s268 0)
(s269 1)
(s270 0)
(s271 1)
(s272 1)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 1)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 1)
(s297 1)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 1)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 0)
(s321 1)
(s322 1)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 1)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 1)
(s345 0)
(s346 1)
(s347 1)
(s348 0)
(s349 0)
(s350 1)
(s351 0)
(s352 1)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 1)
(s368 0)
(s369 1)
(s370 0)
(s371 1)
(s372 1)
(s373 0)
(s374 0)
(s375 1)
(s376 0)
(s377 1)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 1)
(s395 0)
(s396 1)
(s397 1)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 1)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 0)
(s411 0)
(s412 1)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 1)
(s418 0)
(s419 1)
(s420 0)
(s421 1)
(s422 1)
(s423 0)
(s424 0)
(s425 1)
(s426 0)
(s427 1)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 0)
(s437 1)
(s438 0)
(s439 1)
(s440 0)
(s441 1)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 1)
(s447 1)
(s448 0)
(s449 0)
(s450 1)
(s451 0)
(s452 1)
(s453 1)
(s454 0)
(s455 1)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 1)
(s472 1)
(s473 0)
(s474 0)
(s475 1)
(s476 0)
(s477 1)
(s478 1)
(s479 0)
(s480 1)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 1)
(s497 1)
(s498 0)
(s499 0)
(s500 1)
(s501 0)
(s502 1)
(s503 1)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 0)
(s515 0)
(s516 1)
(s517 0)
(s518 1)
(s519 0)
(s520 0)
(s521 1)
(s522 1)
(s523 0)
(s524 0)
(s525 1)
(s526 0)
(s527 1)
(s528 1)
(s529 0)
(s530 1)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 1)
(s537 0)
(s538 1)
(s539 0)
(s540 0)
(s541 1)
(s542 0)
(s543 1)
(s544 0)
(s545 0)
(s546 1)
(s547 1)
(s548 0)
(s549 0)
(s550 1)
(s551 0)
(s552 1)
(s553 1)
(s554 0)
(s555 1)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 1)
(s562 0)
(s563 1)
(s564 0)
(s565 0)
(s566 1)
(s567 0)
(s568 1)
(s569 0)
(s570 0)
(s571 1)
(s572 1)
(s573 0)
(s574 0)
(s575 1)
(s576 0)
(s577 1)
(s578 1)
(s579 0)
(s580 1)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 1)
(s587 0)
(s588 1)
(s589 0)
(s590 0)
(s591 1)
(s592 0)
(s593 1)
(s594 0)
(s595 0)
(s596 1)
(s597 1)
(s598 0)
(s599 0)
(s600 1)
(s601 0)
(s602 1)
(s603 1)
(s604 0)
(s605 1)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 1)
(s614 0)
(s615 0)
(s616 1)
(s617 0)
(s618 1)
(s619 0)
(s620 0)
(s621 1)
(s622 1)
(s623 0)
(s624 0)
(s625 1)
(s626 0)
(s627 1)
(s628 1)
(s629 0)
(s630 1)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 1)
(s637 0)
(s638 1)
(s639 0)
(s640 0)
(s641 1)
(s642 0)
(s643 1)
(s644 0)
(s645 0)
(s646 1)
(s647 1)
(s648 0)
(s649 0)
(s650 1)
(s651 0)
(s652 1)
(s653 1)
(s654 0)
(s655 1)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 1)
(s662 0)
(s663 1)
(s664 0)
(s665 0)
(s666 1)
(s667 0)
(s668 1)
(s669 0)
(s670 0)
(s671 1)
(s672 1)
(s673 0)
(s674 0)
(s675 1)
(s676 0)
(s677 1)
(s678 1)
(s679 0)
(s680 1)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 1)
(s687 0)
(s688 1)
(s689 0)
(s690 0)
(s691 1)
(s692 0)
(s693 1)
(s694 0)
(s695 0)
(s696 1)
(s697 1)
(s698 0)
(s699 0)
(s700 1)
(s701 0)
(s702 1)
(s703 1)
(s704 0)
(s705 1)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 0)
(s713 1)
(s714 0)
(s715 0)
(s716 1)
(s717 0)
(s718 1)
(s719 0)
(s720 0)
(s721 1)
(s722 1)
(s723 0)
(s724 0)
(s725 1)
(s726 0)
(s727 1)
(s728 1)
(s729 0)
(s730 1)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 1)
(s737 0)
(s738 1)
(s739 0)
(s740 0)
(s741 1)
(s742 0)
(s743 1)
(s744 0)
(s745 0)
(s746 1)
(s747 1)
(s748 0)
(s749 0)
(s750 1)
(s751 0)
(s752 1)
(s753 1)
(s754 0)
(s755 1)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 1)
(s762 0)
(s763 1)
(s764 0)
(s765 0)
(s766 1)
(s767 0)
(s768 1)
(s769 0)
(s770 0)
(s771 1)
(s772 1)
(s773 0)
(s774 0)
(s775 1)
(s776 0)
(s777 1)
(s778 1)
(s779 0)
(s780 1)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 1)
(s787 0)
(s788 1)
(s789 0)
(s790 0)
(s791 1)
(s792 0)
(s793 1)
(s794 0)
(s795 0)
(s796 1)
(s797 1)
(s798 0)
(s799 0)
(s800 1)
(s801 0)
(s802 1)
(s803 1)
(s804 0)
(s805 1)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 1)
(s812 0)
(s813 1)
(s814 0)
(s815 0)
(s816 1)
(s817 0)
(s818 1)
(s819 0)
(s820 0)
(s821 1)
(s822 1)
(s823 0)
(s824 0)
(s825 1)
(s826 0)
(s827 1)
(s828 1)
(s829 0)
(s830 1)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 1)
(s837 0)
(s838 1)
(s839 0)
(s840 0)
(s841 1)
(s842 0)
(s843 1)
(s844 0)
(s845 0)
(s846 1)
(s847 1)
(s848 0)
(s849 0)
(s850 1)
(s851 0)
(s852 1)
(s853 1)
(s854 0)
(s855 1)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 1)
(s862 0)
(s863 1)
(s864 0)
(s865 0)
(s866 1)
(s867 0)
(s868 1)
(s869 0)
(s870 0)
(s871 1)
(s872 1)
(s873 0)
(s874 0)
(s875 1)
(s876 0)
(s877 1)
(s878 1)
(s879 0)
(s880 1)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 1)
(s887 0)
(s888 1)
(s889 0)
(s890 0)
(s891 1)
(s892 0)
(s893 1)
(s894 0)
(s895 0)
(s896 1)
(s897 1)
(s898 0)
(s899 0)
(s900 1)
(s901 0)
(s902 1)
(s903 1)
(s904 0)
(s905 1)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 1)
(s912 0)
(s913 1)
(s914 0)
(s915 0)
(s916 1)
(s917 0)
(s918 1)
(s919 0)
(s920 0)
(s921 1)
(s922 1)
(s923 0)
(s924 0)
(s925 1)
(s926 0)
(s927 1)
(s928 1)
(s929 0)
(s930 1)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 1)
(s937 0)
(s938 1)
(s939 0)
(s940 0)
(s941 1)
(s942 0)
(s943 1)
(s944 0)
(s945 0)
(s946 1)
(s947 1)
(s948 0)
(s949 0)
(s950 1)
(s951 0)
(s952 1)
(s953 1)
(s954 0)
(s955 1)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 1)
(s962 0)
(s963 1)
(s964 0)
(s965 0)
(s966 1)
(s967 0)
(s968 1)
(s969 0)
(s970 0)
(s971 1)
(s972 1)
(s973 0)
(s974 0)
(s975 1)
(s976 0)
(s977 1)
(s978 1)
(s979 0)
(s980 1)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 1)
(s987 0)
(s988 1)
(s989 0)
(s990 0)
(s991 1)
(s992 0)
(s993 1)
(s994 0)
(s995 0)
(s996 1)
(s997 1)
(s998 0)
(s999 0)
(s1000 1)
(s1001 0)
(s1002 1)
(s1003 1)
(s1004 0)
(s1005 1)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 1)
(s1012 0)
(s1013 1)
(s1014 0)
(s1015 0)
(s1016 1)
(s1017 0)
(s1018 1)
(s1019 0)
(s1020 0)
(s1021 1)
(s1022 1)
(s1023 0)
(s1024 0)
(s1025 1)
(s1026 0)
(s1027 1)
(s1028 1)
(s1029 0)
(s1030 1)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 1)
(s1037 0)
(s1038 1)
(s1039 0)
(s1040 0)
(s1041 1)
(s1042 0)
(s1043 1)
(s1044 0)
(s1045 0)
(s1046 1)
(s1047 1)
(s1048 0)
(s1049 0)
(s1050 1)
(s1051 0)
(s1052 1)
(s1053 1)
(s1054 0)
(s1055 1)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 1)
(s1062 0)
(s1063 1)
(s1064 0)
(s1065 0)
(s1066 1)
(s1067 0)
(s1068 1)
(s1069 0)
(s1070 0)
(s1071 1)
(s1072 1)
(s1073 0)
(s1074 0)
(s1075 1)
(s1076 0)
(s1077 1)
(s1078 1)
(s1079 0)
(s1080 1)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 1)
(s1087 0)
(s1088 1timeout
)
(s1089 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30021 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60278ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Finished structural reductions in LTL mode , in 1 iterations and 62153 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2))]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-07 finished in 62392 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)))'
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 16 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2025-06-07 21:45:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:45:22] [INFO ] Implicit Places using invariants in 639 ms returned []
[2025-06-07 21:45:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:45:23] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1799 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2025-06-07 21:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2155 variables, and 1252 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30016 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30024 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Finished structural reductions in LTL mode , in 1 iterations and 62095 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 2183 ms.
Product exploration explored 100000 steps with 33333 reset in 2325 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050A-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-08 finished in 66784 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(G(p0))))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 18 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2025-06-07 21:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:46:29] [INFO ] Implicit Places using invariants in 618 ms returned []
[2025-06-07 21:46:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:46:30] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2025-06-07 21:46: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/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2155 variables, and 1252 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30023 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30024 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60273ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60278ms
Finished structural reductions in LTL mode , in 1 iterations and 62195 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-09 finished in 62366 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' '!((p0 U X(X((!p0||X((!p0||F(p1))))))))'
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Applied a total of 0 rules in 18 ms. Remains 1253 /1253 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2025-06-07 21:47:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:47:31] [INFO ] Implicit Places using invariants in 632 ms returned []
[2025-06-07 21:47:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:47:32] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1881 ms to find 0 implicit places.
Running 901 sub problems to find dead transitions.
[2025-06-07 21:47:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 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 1252/2155 variables, and 1252 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30017 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 901/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 901 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 551/1803 constraints. Problems are: Problem set: 0 solved, 901 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1804 constraints. Problems are: Problem set: 0 solved, 901 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 1253/2155 variables, and 1804 constraints, problems are : Problem set: 0 solved, 901 unsolved in 30021 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 901 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Finished structural reductions in LTL mode , in 1 iterations and 62152 ms. Remains : 1253/1253 places, 902/902 transitions.
Stuttering acceptance computed with spot in 411 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-12
Product exploration explored 100000 steps with 168 reset in 763 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-12 finished in 63351 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(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 902/902 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1250 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 1248 transition count 898
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 1247 transition count 897
Applied a total of 9 rules in 77 ms. Remains 1247 /1253 variables (removed 6) and now considering 897/902 (removed 5) transitions.
// Phase 1: matrix 897 rows 1247 cols
[2025-06-07 21:48:34] [INFO ] Computed 550 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:48:35] [INFO ] Implicit Places using invariants in 577 ms returned [1230, 1234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 579 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1245/1253 places, 897/902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1243 transition count 895
Applied a total of 4 rules in 31 ms. Remains 1243 /1245 variables (removed 2) and now considering 895/897 (removed 2) transitions.
// Phase 1: matrix 895 rows 1243 cols
[2025-06-07 21:48:35] [INFO ] Computed 548 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:48:35] [INFO ] Implicit Places using invariants in 608 ms returned []
[2025-06-07 21:48:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:48:36] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1710 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1243/1253 places, 895/902 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2399 ms. Remains : 1243/1253 places, 895/902 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050A-LTLCardinality-13
Product exploration explored 100000 steps with 1945 reset in 712 ms.
Stack based approach found an accepted trace after 1002 steps with 18 reset with depth 32 and stack size 31 in 10 ms.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050A-LTLCardinality-13 finished in 3220 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 U ((F(G(p1))&&F(p2)) U p3)))))'
[2025-06-07 21:48:38] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13954676722778970610
[2025-06-07 21:48:38] [INFO ] Computing symmetric may disable matrix : 902 transitions.
[2025-06-07 21:48:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 21:48:38] [INFO ] Computing symmetric may enable matrix : 902 transitions.
[2025-06-07 21:48:38] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 21:48:38] [INFO ] Applying decomposition
[2025-06-07 21:48:38] [INFO ] Flatten gal took : 66 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/graph4674065956987275122.txt' '-o' '/tmp/graph4674065956987275122.bin' '-w' '/tmp/graph4674065956987275122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4674065956987275122.bin' '-l' '-1' '-v' '-w' '/tmp/graph4674065956987275122.weights' '-q' '0' '-e' '0.001'
[2025-06-07 21:48:38] [INFO ] Computing Do-Not-Accords matrix : 902 transitions.
[2025-06-07 21:48:38] [INFO ] Decomposing Gal with order
[2025-06-07 21:48:38] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 21:48:38] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13954676722778970610
Running compilation step : cd /tmp/ltsmin13954676722778970610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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-07 21:48:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 21:48:38] [INFO ] Removed a total of 150 redundant transitions.
[2025-06-07 21:48:38] [INFO ] Flatten gal took : 52 ms
[2025-06-07 21:48:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 30 ms.
[2025-06-07 21:48:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality11862808433098460893.gal : 12 ms
[2025-06-07 21:48:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality6284365997334819675.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/LTLCardinality11862808433098460893.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6284365997334819675.ltl' '-c' '-stutter-deadlock'
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(G(("((i4.u92.p292==0)||(i0.u9.p28==1))")U(((F(G("(i2.i1.i2.i1.u42.p133==1)")))&&(F("(i11.u212.p668!=1)")))U("((i21.u396.p1240==0)...190
Formula 0 simplified : GF(!"((i4.u92.p292==0)||(i0.u9.p28==1))" R ((GF!"(i2.i1.i2.i1.u42.p133==1)" | G!"(i11.u212.p668!=1)") R !"((i21.u396.p1240==0)||(i3....180
Compilation finished in 2710 ms.
Running link step : cd /tmp/ltsmin13954676722778970610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin13954676722778970610;'/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' '<>([](((LTLAPp0==true) U ((<>([]((LTLAPp1==true)))&&<>((LTLAPp2==true))) U (LTLAPp3==true)))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
4 strongly connected components in search stack
10 transitions explored
6 items max in DFS search stack
4190 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,42.0567,1191980,1,0,2.26835e+06,858,6740,7.76615e+06,129,6289,1760987
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050A-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 824306 ms.
BK_STOP 1749333026770
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldPPPt-PT-050A"
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 ShieldPPPt-PT-050A, 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 r198-tall-174894533600923"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050A.tgz
mv ShieldPPPt-PT-050A 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 ;