Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532900555.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 ShieldIIPt-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532900555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 212K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749152345889

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 19:39:07] [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-05 19:39:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 19:39:07] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2025-06-05 19:39:07] [INFO ] Transformed 763 places.
[2025-06-05 19:39:07] [INFO ] Transformed 563 transitions.
[2025-06-05 19:39:07] [INFO ] Found NUPN structural information;
[2025-06-05 19:39:07] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 203 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 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 70 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2025-06-05 19:39:07] [INFO ] Computed 361 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:39:08] [INFO ] Implicit Places using invariants in 700 ms returned []
[2025-06-05 19:39:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:39:09] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-05 19:39:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/1325 variables, and 1124 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30022 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30032 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60287ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Finished structural reductions in LTL mode , in 1 iterations and 61917 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 38 out of 763 places after structural reductions.
[2025-06-05 19:40:09] [INFO ] Flatten gal took : 125 ms
[2025-06-05 19:40:09] [INFO ] Flatten gal took : 58 ms
[2025-06-05 19:40:09] [INFO ] Input system was already deterministic with 562 transitions.
Support contains 37 out of 763 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1663 ms. (24 steps per ms) remains 9/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 408 ms. (97 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 313 ms. (127 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 306 ms. (130 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 286 ms. (139 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 9/9 properties
[2025-06-05 19:40:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 20/36 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 727/763 variables, 345/397 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 727/1124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 9 unsolved in 987 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 20/36 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 727/763 variables, 345/397 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 727/1124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 9/1896 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/1896 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/1325 variables, 0/1896 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1896 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2111 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3109ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 8 properties in 13153 ms.
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
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 2 place count 762 transition count 561
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 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 84 place count 761 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 85 place count 760 transition count 559
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 87 place count 758 transition count 559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 87 place count 758 transition count 558
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 757 transition count 558
Applied a total of 89 rules in 220 ms. Remains 757 /763 variables (removed 6) and now considering 558/562 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 757/763 places, 558/562 transitions.
RANDOM walk for 40000 steps (8 resets) in 666 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22539 steps, run visited all 1 properties in 211 ms. (steps per millisecond=106 )
Probabilistic random walk after 22539 steps, saw 21636 distinct states, run finished after 215 ms. (steps per millisecond=104 ) properties seen :1
FORMULA ShieldIIPt-PT-040A-LTLCardinality-09 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' '!(F(G((F(p0) U p1))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 48 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2025-06-05 19:40:28] [INFO ] Computed 361 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:40:28] [INFO ] Implicit Places using invariants in 410 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 412 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 30 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2025-06-05 19:40:28] [INFO ] Computed 359 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:40:29] [INFO ] Implicit Places using invariants in 436 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 444 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
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 2 place count 756 transition count 558
Applied a total of 2 rules in 34 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2025-06-05 19:40:29] [INFO ] Computed 358 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:40:29] [INFO ] Implicit Places using invariants in 429 ms returned []
[2025-06-05 19:40:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:40:30] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2085 ms. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 724 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 2 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-02 finished in 3087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 762 transition count 560
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 760 transition count 560
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 758 transition count 559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 758 transition count 558
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 8 place count 757 transition count 558
Applied a total of 8 rules in 48 ms. Remains 757 /763 variables (removed 6) and now considering 558/562 (removed 4) transitions.
// Phase 1: matrix 558 rows 757 cols
[2025-06-05 19:40:31] [INFO ] Computed 359 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:40:31] [INFO ] Implicit Places using invariants in 379 ms returned [746]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 380 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 756/763 places, 558/562 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 755 transition count 557
Applied a total of 2 rules in 30 ms. Remains 755 /756 variables (removed 1) and now considering 557/558 (removed 1) transitions.
// Phase 1: matrix 557 rows 755 cols
[2025-06-05 19:40:31] [INFO ] Computed 358 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:40:32] [INFO ] Implicit Places using invariants in 401 ms returned []
[2025-06-05 19:40:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:40:32] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 755/763 places, 557/562 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1477 ms. Remains : 755/763 places, 557/562 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 662 ms.
Product exploration explored 100000 steps with 0 reset in 894 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 341 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 27369 steps, run visited all 1 properties in 226 ms. (steps per millisecond=121 )
Probabilistic random walk after 27369 steps, saw 26689 distinct states, run finished after 227 ms. (steps per millisecond=120 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 755 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 755/755 places, 557/557 transitions.
Applied a total of 0 rules in 17 ms. Remains 755 /755 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2025-06-05 19:40:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:40:35] [INFO ] Implicit Places using invariants in 336 ms returned []
[2025-06-05 19:40:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:40:36] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:40:36] [INFO ] Redundant transitions in 26 ms returned []
Running 556 sub problems to find dead transitions.
[2025-06-05 19:40:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/755 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/1312 variables, 755/1868 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1312/1312 variables, and 1868 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30020 ms.
Refiners :[Domain max(s): 755/755 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/755 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/1312 variables, 755/1868 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1312 variables, 556/2424 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1312/1312 variables, and 2424 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30015 ms.
Refiners :[Domain max(s): 755/755 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61086 ms. Remains : 755/755 places, 557/557 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 321 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 27369 steps, run visited all 1 properties in 217 ms. (steps per millisecond=126 )
Probabilistic random walk after 27369 steps, saw 26689 distinct states, run finished after 218 ms. (steps per millisecond=125 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 608 ms.
Product exploration explored 100000 steps with 0 reset in 823 ms.
Built C files in :
/tmp/ltsmin269337362301258408
[2025-06-05 19:41:38] [INFO ] Computing symmetric may disable matrix : 557 transitions.
[2025-06-05 19:41:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:41:38] [INFO ] Computing symmetric may enable matrix : 557 transitions.
[2025-06-05 19:41:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:41:38] [INFO ] Computing Do-Not-Accords matrix : 557 transitions.
[2025-06-05 19:41:38] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:41:38] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin269337362301258408
Running compilation step : cd /tmp/ltsmin269337362301258408;'/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 1476 ms.
Running link step : cd /tmp/ltsmin269337362301258408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin269337362301258408;'/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/stateBased7682702475856919549.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 755 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 755/755 places, 557/557 transitions.
Applied a total of 0 rules in 19 ms. Remains 755 /755 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2025-06-05 19:41:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:41:54] [INFO ] Implicit Places using invariants in 347 ms returned []
[2025-06-05 19:41:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:41:54] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:41:54] [INFO ] Redundant transitions in 10 ms returned []
Running 556 sub problems to find dead transitions.
[2025-06-05 19:41:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/755 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/1312 variables, 755/1868 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1312/1312 variables, and 1868 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30016 ms.
Refiners :[Domain max(s): 755/755 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/755 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/1312 variables, 755/1868 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1312 variables, 556/2424 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1312/1312 variables, and 2424 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30023 ms.
Refiners :[Domain max(s): 755/755 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 755/755 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61081 ms. Remains : 755/755 places, 557/557 transitions.
Built C files in :
/tmp/ltsmin9389528071252605215
[2025-06-05 19:42:54] [INFO ] Computing symmetric may disable matrix : 557 transitions.
[2025-06-05 19:42:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:42:54] [INFO ] Computing symmetric may enable matrix : 557 transitions.
[2025-06-05 19:42:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:42:54] [INFO ] Computing Do-Not-Accords matrix : 557 transitions.
[2025-06-05 19:42:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:42:54] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9389528071252605215
Running compilation step : cd /tmp/ltsmin9389528071252605215;'/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 1350 ms.
Running link step : cd /tmp/ltsmin9389528071252605215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9389528071252605215;'/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/stateBased11735706173479954568.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 19:43:09] [INFO ] Flatten gal took : 29 ms
[2025-06-05 19:43:09] [INFO ] Flatten gal took : 28 ms
[2025-06-05 19:43:10] [INFO ] Time to serialize gal into /tmp/LTL15974521144660657554.gal : 7 ms
[2025-06-05 19:43:10] [INFO ] Time to serialize properties into /tmp/LTL4502951426254610344.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/LTL15974521144660657554.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5549001479852779578.hoa' '-atoms' '/tmp/LTL4502951426254610344.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4502951426254610344.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5549001479852779578.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-05 19:43:25] [INFO ] Flatten gal took : 27 ms
[2025-06-05 19:43:25] [INFO ] Flatten gal took : 24 ms
[2025-06-05 19:43:25] [INFO ] Time to serialize gal into /tmp/LTL9767729722699027917.gal : 6 ms
[2025-06-05 19:43:25] [INFO ] Time to serialize properties into /tmp/LTL644891913976689759.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/LTL9767729722699027917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL644891913976689759.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...274
Read 1 LTL properties
Checking formula 0 : !((F(G("((p80==0)||(p574==1))"))))
Formula 0 simplified : GF!"((p80==0)||(p574==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-05 19:43:40] [INFO ] Flatten gal took : 21 ms
[2025-06-05 19:43:40] [INFO ] Applying decomposition
[2025-06-05 19:43:40] [INFO ] Flatten gal took : 21 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/graph10067670522668472527.txt' '-o' '/tmp/graph10067670522668472527.bin' '-w' '/tmp/graph10067670522668472527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10067670522668472527.bin' '-l' '-1' '-v' '-w' '/tmp/graph10067670522668472527.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:43:40] [INFO ] Decomposing Gal with order
[2025-06-05 19:43:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:43:40] [INFO ] Removed a total of 119 redundant transitions.
[2025-06-05 19:43:40] [INFO ] Flatten gal took : 68 ms
[2025-06-05 19:43:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-05 19:43:40] [INFO ] Time to serialize gal into /tmp/LTL2495682653638252694.gal : 11 ms
[2025-06-05 19:43:40] [INFO ] Time to serialize properties into /tmp/LTL1450029489981892732.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/LTL2495682653638252694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1450029489981892732.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...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i2.u33.p80==0)||(i16.i1.i0.u241.p574==1))"))))
Formula 0 simplified : GF!"((i2.u33.p80==0)||(i16.i1.i0.u241.p574==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-05 finished in 204083 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 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 7 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2025-06-05 19:43:55] [INFO ] Computed 361 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:43:56] [INFO ] Implicit Places using invariants in 417 ms returned []
[2025-06-05 19:43:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:43:56] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-05 19:43:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 1.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 1.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 timeout
1.0)
(s451 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/1325 variables, and 1124 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30020 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30023 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Finished structural reductions in LTL mode , in 1 iterations and 61293 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 625 ms.
Product exploration explored 100000 steps with 0 reset in 788 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 : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2025-06-05 19:44:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 19:44:59] [INFO ] [Real]Absence check using 361 positive place invariants in 488 ms returned sat
[2025-06-05 19:44:59] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2025-06-05 19:44:59] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 29 ms.
[2025-06-05 19:45:00] [INFO ] Added : 0 causal constraints over 0 iterations in 84 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 6 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2025-06-05 19:45:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:45:00] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-06-05 19:45:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:45:01] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-05 19:45:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 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 763/1325 variables, and 1124 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30016 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30024 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Finished structural reductions in LTL mode , in 1 iterations and 61203 ms. Remains : 763/763 places, 562/562 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 : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2025-06-05 19:46:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 19:46:02] [INFO ] [Real]Absence check using 361 positive place invariants in 494 ms returned sat
[2025-06-05 19:46:02] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2025-06-05 19:46:02] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints (skipped 0 transitions) in 29 ms.
[2025-06-05 19:46:02] [INFO ] Added : 0 causal constraints over 0 iterations in 84 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 611 ms.
Product exploration explored 100000 steps with 0 reset in 807 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 562
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 763 transition count 562
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 82 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:46:04] [INFO ] Redundant transitions in 4 ms returned []
Running 561 sub problems to find dead transitions.
// Phase 1: matrix 562 rows 763 cols
[2025-06-05 19:46:04] [INFO ] Computed 361 invariants in 3 ms
[2025-06-05 19:46:04] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:46:30] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 8 ms to minimize.
Problem TDEAD200 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:46:31] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD284 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 2/1126 constraints. Problems are: Problem set: 2 solved, 559 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/1325 variables, and 1126 constraints, problems are : Problem set: 2 solved, 559 unsolved in 30014 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/763 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 559 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/760 variables, 760/760 constraints. Problems are: Problem set: 2 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/760 variables, 0/760 constraints. Problems are: Problem set: 2 solved, 559 unsolved
At refinement iteration 2 (OVERLAPS) 3/763 variables, 361/1121 constraints. Problems are: Problem set: 2 solved, 559 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 3/1124 constraints. Problems are: Problem set: 2 solved, 559 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 2/1126 constraints. Problems are: Problem set: 2 solved, 559 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 0/1126 constraints. Problems are: Problem set: 2 solved, 559 unsolved
At refinement iteration 6 (OVERLAPS) 562/1325 variables, 763/1889 constraints. Problems are: Problem set: 2 solved, 559 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1325 variables, 3/1892 constraints. Problems are: Problem set: 2 solved, 559 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1325 variables, 559/2451 constraints. Problems are: Problem set: 2 solved, 559 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2451 constraints, problems are : Problem set: 2 solved, 559 unsolved in 30015 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 559/561 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 2 solved, 559 unsolved
Search for dead transitions found 2 dead transitions in 60159ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 763/763 places, 560/562 transitions.
Graph (complete) has 2201 edges and 763 vertex of which 761 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 761 /763 variables (removed 2) and now considering 560/560 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 761/763 places, 560/562 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60277 ms. Remains : 761/763 places, 560/562 transitions.
Built C files in :
/tmp/ltsmin13874307153598482683
[2025-06-05 19:47:05] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13874307153598482683
Running compilation step : cd /tmp/ltsmin13874307153598482683;'/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 972 ms.
Running link step : cd /tmp/ltsmin13874307153598482683;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13874307153598482683;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9930428091667905918.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 14 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2025-06-05 19:47:20] [INFO ] Computed 361 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:47:20] [INFO ] Implicit Places using invariants in 370 ms returned []
[2025-06-05 19:47:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:47:21] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-05 19:47: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/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 1.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/1325 variables, and 1124 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30016 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30025 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Finished structural reductions in LTL mode , in 1 iterations and 61245 ms. Remains : 763/763 places, 562/562 transitions.
Built C files in :
/tmp/ltsmin8148246757573341249
[2025-06-05 19:48:21] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8148246757573341249
Running compilation step : cd /tmp/ltsmin8148246757573341249;'/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 988 ms.
Running link step : cd /tmp/ltsmin8148246757573341249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8148246757573341249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7920591372192440543.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 19:48:36] [INFO ] Flatten gal took : 36 ms
[2025-06-05 19:48:36] [INFO ] Flatten gal took : 28 ms
[2025-06-05 19:48:36] [INFO ] Time to serialize gal into /tmp/LTL16140823353334845639.gal : 4 ms
[2025-06-05 19:48:36] [INFO ] Time to serialize properties into /tmp/LTL4470197672410232246.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/LTL16140823353334845639.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2888157488117990834.hoa' '-atoms' '/tmp/LTL4470197672410232246.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4470197672410232246.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2888157488117990834.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-05 19:48:51] [INFO ] Flatten gal took : 26 ms
[2025-06-05 19:48:51] [INFO ] Flatten gal took : 25 ms
[2025-06-05 19:48:51] [INFO ] Time to serialize gal into /tmp/LTL1468315512336187429.gal : 3 ms
[2025-06-05 19:48:51] [INFO ] Time to serialize properties into /tmp/LTL6839130202360536691.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/LTL1468315512336187429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6839130202360536691.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((p266==1)&&(p101==0))")))))
Formula 0 simplified : XXF!"((p266==1)&&(p101==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-05 19:49:06] [INFO ] Flatten gal took : 24 ms
[2025-06-05 19:49:06] [INFO ] Applying decomposition
[2025-06-05 19:49:06] [INFO ] Flatten gal took : 24 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/graph1311885258109290029.txt' '-o' '/tmp/graph1311885258109290029.bin' '-w' '/tmp/graph1311885258109290029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1311885258109290029.bin' '-l' '-1' '-v' '-w' '/tmp/graph1311885258109290029.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:49:06] [INFO ] Decomposing Gal with order
[2025-06-05 19:49:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:49:07] [INFO ] Removed a total of 120 redundant transitions.
[2025-06-05 19:49:07] [INFO ] Flatten gal took : 36 ms
[2025-06-05 19:49:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2025-06-05 19:49:07] [INFO ] Time to serialize gal into /tmp/LTL11028671207791932047.gal : 9 ms
[2025-06-05 19:49:07] [INFO ] Time to serialize properties into /tmp/LTL18428897859608015899.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/LTL11028671207791932047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18428897859608015899.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i8.i0.i1.u111.p266==1)&&(i3.u42.p101==0))")))))
Formula 0 simplified : XXF!"((i8.i0.i1.u111.p266==1)&&(i3.u42.p101==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
80 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,0.895607,40448,1,0,51798,432,3775,87938,120,1732,89935
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-07 finished in 312440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(X(p1)) U ((!p2&&X(X(p1)))||X(X(G(p1))))))))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2025-06-05 19:49:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:49:08] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-06-05 19:49:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:49:09] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-05 19:49:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/1325 variables, and 1124 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30017 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 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 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30021 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Finished structural reductions in LTL mode , in 1 iterations and 61282 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-10 finished in 61510 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(X(X(p0)))))&&(p0 U X(p1))))'
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 13 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2025-06-05 19:50:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:50:09] [INFO ] Implicit Places using invariants in 364 ms returned []
[2025-06-05 19:50:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:50:10] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-05 19:50:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/1325 variables, and 1124 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30018 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30021 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Finished structural reductions in LTL mode , in 1 iterations and 61276 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 245 steps with 0 reset in 5 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-11 finished in 61588 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((G((G(p1)||p0))&&F(p2))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 14 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2025-06-05 19:51:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:51:11] [INFO ] Implicit Places using invariants in 378 ms returned []
[2025-06-05 19:51:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:51:12] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-05 19:51:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 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 763/1325 variables, and 1124 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30022 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
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 1)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 1)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 1)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 1)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 1)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 1)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 1)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 1)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 1)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 1)
(s160 1)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 1)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 1)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 1)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 1)
(s212 1)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 1)
(s219 1)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 1)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 1)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 1)
(s250 1)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 1)
(s259 0)
(s260 1)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 1)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 1)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 1)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 1)
(s297 0)
(s298 1)
(s299 0)
(s300 1)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 1)
(s316 0)
(s317 1)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 1)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 1)
(s352 1)
(s353 0)
(s354 0)
(s355 1)
(s356 0)
(s357 1)
(s358 1)
(s359 0)
(s360 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30023 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Finished structural reductions in LTL mode , in 1 iterations and 61279 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 641 ms.
Product exploration explored 100000 steps with 0 reset in 793 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 p1 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p2)), (X p0), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 102 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 498 ms. (80 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
[2025-06-05 19:52:14] [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/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 756/763 variables, 358/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 756/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 3 unsolved in 409 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 756/763 variables, 358/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 756/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 3/1890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1325 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1890 constraints, problems are : Problem set: 0 solved, 3 unsolved in 748 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1170ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 496 ms.
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
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 762 transition count 561
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 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 84 place count 761 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 85 place count 760 transition count 559
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 87 place count 758 transition count 559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 87 place count 758 transition count 558
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 757 transition count 558
Applied a total of 89 rules in 54 ms. Remains 757 /763 variables (removed 6) and now considering 558/562 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 757/763 places, 558/562 transitions.
RANDOM walk for 40000 steps (8 resets) in 480 ms. (83 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 7418 steps, run visited all 3 properties in 96 ms. (steps per millisecond=77 )
Probabilistic random walk after 7418 steps, saw 7159 distinct states, run finished after 97 ms. (steps per millisecond=76 ) properties seen :3
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p2)), (X p0), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 20 factoid took 195 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-12 finished in 65991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(!p0))))'
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 15 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2025-06-05 19:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:52:17] [INFO ] Implicit Places using invariants in 351 ms returned []
[2025-06-05 19:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:52:18] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-05 19:52: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/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/1325 variables, and 1124 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30013 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30025 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Finished structural reductions in LTL mode , in 1 iterations and 61259 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, p0, true]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-13 finished in 61376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1 U p2)))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 12 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2025-06-05 19:53:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:53:18] [INFO ] Implicit Places using invariants in 357 ms returned []
[2025-06-05 19:53:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:53:19] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-05 19:53:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)timeout

(s81 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/1325 variables, and 1124 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30014 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 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 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30016 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Finished structural reductions in LTL mode , in 1 iterations and 61205 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 2109 ms.
Product exploration explored 100000 steps with 50000 reset in 2143 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 (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 16 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-14 finished in 65670 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((X((F(p0)&&F(p1)))||F(p2))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
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 2 place count 762 transition count 561
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 4 place count 761 transition count 560
Applied a total of 4 rules in 29 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2025-06-05 19:54:24] [INFO ] Computed 361 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:54:24] [INFO ] Implicit Places using invariants in 377 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 378 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
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 758 transition count 559
Applied a total of 2 rules in 16 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2025-06-05 19:54:24] [INFO ] Computed 359 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:54:24] [INFO ] Implicit Places using invariants in 369 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 371 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
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 2 place count 756 transition count 558
Applied a total of 2 rules in 20 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2025-06-05 19:54:24] [INFO ] Computed 358 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:54:25] [INFO ] Implicit Places using invariants in 406 ms returned []
[2025-06-05 19:54:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:54:26] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1874 ms. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-15
Product exploration explored 100000 steps with 3 reset in 622 ms.
Stack based approach found an accepted trace after 112 steps with 0 reset with depth 113 and stack size 113 in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-15 finished in 2661 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)))'
[2025-06-05 19:54:26] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13552864191562899914
[2025-06-05 19:54:26] [INFO ] Computing symmetric may disable matrix : 562 transitions.
[2025-06-05 19:54:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:54:26] [INFO ] Computing symmetric may enable matrix : 562 transitions.
[2025-06-05 19:54:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:54:27] [INFO ] Applying decomposition
[2025-06-05 19:54:27] [INFO ] Flatten gal took : 42 ms
[2025-06-05 19:54:27] [INFO ] Computing Do-Not-Accords matrix : 562 transitions.
[2025-06-05 19:54:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:54:27] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13552864191562899914
Running compilation step : cd /tmp/ltsmin13552864191562899914;'/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'
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/graph17926204912757851673.txt' '-o' '/tmp/graph17926204912757851673.bin' '-w' '/tmp/graph17926204912757851673.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17926204912757851673.bin' '-l' '-1' '-v' '-w' '/tmp/graph17926204912757851673.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:54:27] [INFO ] Decomposing Gal with order
[2025-06-05 19:54:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:54:27] [INFO ] Removed a total of 120 redundant transitions.
[2025-06-05 19:54:27] [INFO ] Flatten gal took : 35 ms
[2025-06-05 19:54:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2025-06-05 19:54:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality8442220821780489662.gal : 10 ms
[2025-06-05 19:54:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality1749550659832325802.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/LTLCardinality8442220821780489662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1749550659832325802.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((i2.i0.i1.u33.p80==0)||(i16.i1.i1.u241.p574==1))"))))
Formula 0 simplified : GF!"((i2.i0.i1.u33.p80==0)||(i16.i1.i1.u241.p574==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 1419 ms.
Running link step : cd /tmp/ltsmin13552864191562899914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13552864191562899914;'/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)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.068: Initializing POR dependencies: labels 563, guards 562
pins2lts-mc-linux64( 5/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 6.431: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 6.431: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 6.431: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 7.099: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 7.112: There are 564 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 7.112: State length is 764, there are 566 groups
pins2lts-mc-linux64( 0/ 8), 7.112: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 7.112: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 7.112: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 7.112: Visible groups: 0 / 566, labels: 1 / 564
pins2lts-mc-linux64( 0/ 8), 7.112: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 7.112: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 7.167: [Blue] ~120 levels ~960 states ~2440 transitions
pins2lts-mc-linux64( 4/ 8), 7.233: [Blue] ~240 levels ~1920 states ~5416 transitions
pins2lts-mc-linux64( 4/ 8), 7.377: [Blue] ~480 levels ~3840 states ~12160 transitions
pins2lts-mc-linux64( 4/ 8), 7.577: [Blue] ~960 levels ~7680 states ~21680 transitions
pins2lts-mc-linux64( 4/ 8), 8.022: [Blue] ~1920 levels ~15360 states ~41008 transitions
pins2lts-mc-linux64( 3/ 8), 8.674: [Blue] ~3826 levels ~30720 states ~71128 transitions
pins2lts-mc-linux64( 3/ 8), 9.890: [Blue] ~7651 levels ~61440 states ~146168 transitions
pins2lts-mc-linux64( 3/ 8), 12.255: [Blue] ~15320 levels ~122880 states ~304032 transitions
pins2lts-mc-linux64( 3/ 8), 16.809: [Blue] ~30662 levels ~245760 states ~617240 transitions
pins2lts-mc-linux64( 3/ 8), 25.251: [Blue] ~61304 levels ~491520 states ~1261680 transitions
pins2lts-mc-linux64( 3/ 8), 42.210: [Blue] ~122650 levels ~983040 states ~2607392 transitions
pins2lts-mc-linux64( 3/ 8), 76.652: [Blue] ~245264 levels ~1966080 states ~5160304 transitions
pins2lts-mc-linux64( 3/ 8), 149.716: [Blue] ~490706 levels ~3932160 states ~10703992 transitions
pins2lts-mc-linux64( 6/ 8), 182.051: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 182.508:
pins2lts-mc-linux64( 0/ 8), 182.508: Explored 3991208 states 11559823 transitions, fanout: 2.896
pins2lts-mc-linux64( 0/ 8), 182.508: Total exploration time 175.380 sec (174.990 sec minimum, 175.116 sec on average)
pins2lts-mc-linux64( 0/ 8), 182.508: States per second: 22757, Transitions per second: 65913
pins2lts-mc-linux64( 0/ 8), 182.509:
pins2lts-mc-linux64( 0/ 8), 182.509: State space has 16418187 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 182.509: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 182.509: blue states: 3991208 (24.31%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 182.509: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 182.509: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 182.509:
pins2lts-mc-linux64( 0/ 8), 182.509: Total memory used for local state coloring: 60.8MB
pins2lts-mc-linux64( 0/ 8), 182.509:
pins2lts-mc-linux64( 0/ 8), 182.509: Queue width: 8B, total height: 3985334, memory: 30.41MB
pins2lts-mc-linux64( 0/ 8), 182.509: Tree memory: 381.3MB, 24.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 182.509: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 182.509: Stored 571 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 182.509: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 182.509: Est. total memory use: 411.7MB (~1054.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13552864191562899914;'/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)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13552864191562899914;'/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)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-05 20:19:35] [INFO ] Applying decomposition
[2025-06-05 20:19:35] [INFO ] Flatten gal took : 346 ms
[2025-06-05 20:19:35] [INFO ] Decomposing Gal with order
[2025-06-05 20:19:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 20:19:36] [INFO ] Removed a total of 160 redundant transitions.
[2025-06-05 20:19:36] [INFO ] Flatten gal took : 361 ms
[2025-06-05 20:19:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 82 ms.
[2025-06-05 20:19:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality5088406705572897187.gal : 56 ms
[2025-06-05 20:19:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality10417288597269721372.ltl : 7 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/LTLCardinality5088406705572897187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10417288597269721372.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("((u42.p80==0)||(u302.p574==1))"))))
Formula 0 simplified : GF!"((u42.p80==0)||(u302.p574==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1556 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,15.674,476204,1,0,950799,1099,8293,1.78324e+06,44,804,1753100
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2448219 ms.

BK_STOP 1749154795718

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-040A"
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 ShieldIIPt-PT-040A, 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-174894532900555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040A.tgz
mv ShieldIIPt-PT-040A 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;