Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761500644.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldPPPt-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761500644
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 201K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717014831198

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 20:33:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 20:33:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:33:52] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-05-29 20:33:52] [INFO ] Transformed 753 places.
[2024-05-29 20:33:52] [INFO ] Transformed 543 transitions.
[2024-05-29 20:33:52] [INFO ] Found NUPN structural information;
[2024-05-29 20:33:52] [INFO ] Parsed PT model containing 753 places and 543 transitions and 2166 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-030A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 65 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2024-05-29 20:33:52] [INFO ] Computed 331 invariants in 25 ms
[2024-05-29 20:33:53] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-05-29 20:33:53] [INFO ] Invariant cache hit.
[2024-05-29 20:33:54] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 1327 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-29 20:33:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1837 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30044 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 541/2378 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 2378 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30025 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60348ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Finished structural reductions in LTL mode , in 1 iterations and 61802 ms. Remains : 753/753 places, 542/542 transitions.
Support contains 57 out of 753 places after structural reductions.
[2024-05-29 20:34:54] [INFO ] Flatten gal took : 99 ms
[2024-05-29 20:34:54] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:34:55] [INFO ] Input system was already deterministic with 542 transitions.
Support contains 52 out of 753 places (down from 57) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 28 to 26
RANDOM walk for 40000 steps (8 resets) in 2203 ms. (18 steps per ms) remains 15/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
[2024-05-29 20:34:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 54/85 variables, 35/66 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 668/753 variables, 296/416 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 668/1084 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1295 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/1295 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1837 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1136 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 54/85 variables, 35/66 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 668/753 variables, 296/416 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 668/1084 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1295 variables, 15/1852 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1295 variables, 0/1852 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/1295 variables, 0/1852 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1852 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2147 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 3306ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 11 different solutions.
Finished Parikh walk after 5109 steps, including 133 resets, run visited all 15 properties in 127 ms. (steps per millisecond=40 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 15 properties in 135 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-12 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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&(F(p0) U p1)))))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 16 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-29 20:34:59] [INFO ] Invariant cache hit.
[2024-05-29 20:35:00] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-29 20:35:00] [INFO ] Invariant cache hit.
[2024-05-29 20:35:00] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-29 20:35:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1837 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30015 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 541/2378 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 2378 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30020 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Finished structural reductions in LTL mode , in 1 iterations and 61204 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-00
Product exploration explored 100000 steps with 112 reset in 658 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-00 finished in 62288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X((p1||G(p0)))))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 13 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-29 20:36:02] [INFO ] Invariant cache hit.
[2024-05-29 20:36:02] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-29 20:36:02] [INFO ] Invariant cache hit.
[2024-05-29 20:36:03] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-29 20:36:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1837 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30019 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 541/2378 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 2378 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30020 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Finished structural reductions in LTL mode , in 1 iterations and 61262 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-01 finished in 61522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(X(F((p3&&F(!p3))))||p2))))'
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 40 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-29 20:37:03] [INFO ] Invariant cache hit.
[2024-05-29 20:37:03] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-29 20:37:03] [INFO ] Invariant cache hit.
[2024-05-29 20:37:04] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-29 20:37:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1837 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30023 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 541/2378 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 2378 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30018 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Finished structural reductions in LTL mode , in 1 iterations and 61209 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), true, p3]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-03 finished in 61511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p0)))||F((G(F(p1))||(F(p1)&&p2)))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 59 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 20:38:05] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 20:38:05] [INFO ] Implicit Places using invariants in 390 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 53 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2024-05-29 20:38:05] [INFO ] Computed 330 invariants in 5 ms
[2024-05-29 20:38:05] [INFO ] Implicit Places using invariants in 399 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 402 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 33 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 20:38:06] [INFO ] Computed 328 invariants in 6 ms
[2024-05-29 20:38:06] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-29 20:38:06] [INFO ] Invariant cache hit.
[2024-05-29 20:38:07] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2015 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 592 ms.
Product exploration explored 100000 steps with 0 reset in 737 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 p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 112 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 438 ms. (91 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
[2024-05-29 20:38:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 732/744 variables, 323/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 732/1072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1280 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 1816 constraints, problems are : Problem set: 0 solved, 5 unsolved in 528 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 732/744 variables, 323/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 732/1072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 5/1821 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 0/1821 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1280 variables, 0/1821 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 1821 constraints, problems are : Problem set: 0 solved, 5 unsolved in 722 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1260ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 717 steps, including 0 resets, run visited all 5 properties in 15 ms. (steps per millisecond=47 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 15 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F p2), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 17 factoid took 387 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 25 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2024-05-29 20:38:11] [INFO ] Invariant cache hit.
[2024-05-29 20:38:11] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-29 20:38:11] [INFO ] Invariant cache hit.
[2024-05-29 20:38:12] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
[2024-05-29 20:38:12] [INFO ] Redundant transitions in 30 ms returned []
Running 535 sub problems to find dead transitions.
[2024-05-29 20:38:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 743/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/744 variables, 328/1071 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 535 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 1280/1280 variables, and 1816 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30022 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 743/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/744 variables, 328/1071 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 535/2351 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 2351 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30014 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61228 ms. Remains : 744/744 places, 536/536 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 116 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 385 ms. (103 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 320 ms. (124 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 273 ms. (145 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 274 ms. (145 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 266 ms. (149 steps per ms) remains 5/5 properties
[2024-05-29 20:39:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 732/744 variables, 323/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 732/1072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1280 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 1816 constraints, problems are : Problem set: 0 solved, 5 unsolved in 508 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 732/744 variables, 323/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 732/1072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 5/1821 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 0/1821 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1280 variables, 0/1821 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 1821 constraints, problems are : Problem set: 0 solved, 5 unsolved in 729 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1248ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 499 steps, including 0 resets, run visited all 5 properties in 17 ms. (steps per millisecond=29 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 19 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F p2), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F p1)]
Knowledge based reduction with 17 factoid took 406 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 550 ms.
Product exploration explored 100000 steps with 0 reset in 780 ms.
Built C files in :
/tmp/ltsmin16008525286952263632
[2024-05-29 20:39:17] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2024-05-29 20:39:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:39:17] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2024-05-29 20:39:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:39:17] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2024-05-29 20:39:17] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:39:17] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16008525286952263632
Running compilation step : cd /tmp/ltsmin16008525286952263632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1624 ms.
Running link step : cd /tmp/ltsmin16008525286952263632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin16008525286952263632;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3979531588035085811.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 29 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2024-05-29 20:39:32] [INFO ] Invariant cache hit.
[2024-05-29 20:39:32] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-29 20:39:32] [INFO ] Invariant cache hit.
[2024-05-29 20:39:33] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2024-05-29 20:39:33] [INFO ] Redundant transitions in 3 ms returned []
Running 535 sub problems to find dead transitions.
[2024-05-29 20:39:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 743/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/744 variables, 328/1071 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 535 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 1280/1280 variables, and 1816 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30017 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 743/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/744 variables, 328/1071 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 535/2351 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 2351 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30021 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61156 ms. Remains : 744/744 places, 536/536 transitions.
Built C files in :
/tmp/ltsmin3233279549014606196
[2024-05-29 20:40:33] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2024-05-29 20:40:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:40:33] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2024-05-29 20:40:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:40:33] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2024-05-29 20:40:33] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:40:33] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3233279549014606196
Running compilation step : cd /tmp/ltsmin3233279549014606196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1487 ms.
Running link step : cd /tmp/ltsmin3233279549014606196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3233279549014606196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9502544426846411543.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:40:48] [INFO ] Flatten gal took : 39 ms
[2024-05-29 20:40:48] [INFO ] Flatten gal took : 32 ms
[2024-05-29 20:40:48] [INFO ] Time to serialize gal into /tmp/LTL15248303999129697466.gal : 7 ms
[2024-05-29 20:40:48] [INFO ] Time to serialize properties into /tmp/LTL17918803545982546144.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15248303999129697466.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4318706932093903336.hoa' '-atoms' '/tmp/LTL17918803545982546144.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17918803545982546144.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4318706932093903336.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 20:41:03] [INFO ] Flatten gal took : 31 ms
[2024-05-29 20:41:03] [INFO ] Flatten gal took : 30 ms
[2024-05-29 20:41:03] [INFO ] Time to serialize gal into /tmp/LTL8073779816751102213.gal : 6 ms
[2024-05-29 20:41:03] [INFO ] Time to serialize properties into /tmp/LTL16734225847796824174.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8073779816751102213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16734225847796824174.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(("(p276==0)")&&(X("(p276==0)"))))||(F((G(F("(p151==1)")))||(("((p680==1)&&(p697==1))")&&(F("(p151==1)")))))))
Formula 0 simplified : F(!"(p276==0)" | X!"(p276==0)") & G(FG!"(p151==1)" & (!"((p680==1)&&(p697==1))" | G!"(p151==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 20:41:18] [INFO ] Flatten gal took : 32 ms
[2024-05-29 20:41:18] [INFO ] Applying decomposition
[2024-05-29 20:41:18] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17513564887912149536.txt' '-o' '/tmp/graph17513564887912149536.bin' '-w' '/tmp/graph17513564887912149536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17513564887912149536.bin' '-l' '-1' '-v' '-w' '/tmp/graph17513564887912149536.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:41:19] [INFO ] Decomposing Gal with order
[2024-05-29 20:41:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:41:19] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-29 20:41:19] [INFO ] Flatten gal took : 72 ms
[2024-05-29 20:41:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 41 ms.
[2024-05-29 20:41:19] [INFO ] Time to serialize gal into /tmp/LTL7541271332629985408.gal : 14 ms
[2024-05-29 20:41:19] [INFO ] Time to serialize properties into /tmp/LTL16009163410778365794.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7541271332629985408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16009163410778365794.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(("(i6.i1.i4.u88.p276==0)")&&(X("(i6.i1.i4.u88.p276==0)"))))||(F((G(F("(i3.i0.i0.u48.p151==1)")))||(("((i16.u218.p680==1)&&(i16.u...206
Formula 0 simplified : F(!"(i6.i1.i4.u88.p276==0)" | X!"(i6.i1.i4.u88.p276==0)") & G(FG!"(i3.i0.i0.u48.p151==1)" & (!"((i16.u218.p680==1)&&(i16.u222.p697==...190
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-030A-LTLFireability-04 finished in 209303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||(G(p1) U p2)))))'
Support contains 8 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 15 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2024-05-29 20:41:34] [INFO ] Computed 331 invariants in 4 ms
[2024-05-29 20:41:34] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-29 20:41:34] [INFO ] Invariant cache hit.
[2024-05-29 20:41:35] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-29 20:41:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1837 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30013 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 541/2378 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 2378 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30022 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Finished structural reductions in LTL mode , in 1 iterations and 61369 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-05 finished in 61624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 12 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-29 20:42:35] [INFO ] Invariant cache hit.
[2024-05-29 20:42:36] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-29 20:42:36] [INFO ] Invariant cache hit.
[2024-05-29 20:42:37] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-29 20:42:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1837 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30017 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 541/2378 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 2378 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30020 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Finished structural reductions in LTL mode , in 1 iterations and 61211 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-06 finished in 61349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)&&p0)) U X(p2))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 15 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-29 20:43:37] [INFO ] Invariant cache hit.
[2024-05-29 20:43:37] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-29 20:43:37] [INFO ] Invariant cache hit.
[2024-05-29 20:43:38] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-29 20:43:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1837 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30018 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 541/2378 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 2378 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30021 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Finished structural reductions in LTL mode , in 1 iterations and 61218 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 571 ms.
Stack based approach found an accepted trace after 92 steps with 0 reset with depth 93 and stack size 93 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-08 finished in 62091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 48 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 20:44:39] [INFO ] Computed 331 invariants in 7 ms
[2024-05-29 20:44:39] [INFO ] Implicit Places using invariants in 393 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 394 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 23 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2024-05-29 20:44:39] [INFO ] Computed 330 invariants in 4 ms
[2024-05-29 20:44:40] [INFO ] Implicit Places using invariants in 365 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 367 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 30 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 20:44:40] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 20:44:40] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-29 20:44:40] [INFO ] Invariant cache hit.
[2024-05-29 20:44:41] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1867 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 543 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-09 finished in 2456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 28 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 20:44:41] [INFO ] Computed 331 invariants in 5 ms
[2024-05-29 20:44:42] [INFO ] Implicit Places using invariants in 393 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 394 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 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 750 transition count 539
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 749 transition count 539
Applied a total of 2 rules in 21 ms. Remains 749 /750 variables (removed 1) and now considering 539/540 (removed 1) transitions.
// Phase 1: matrix 539 rows 749 cols
[2024-05-29 20:44:42] [INFO ] Computed 330 invariants in 4 ms
[2024-05-29 20:44:42] [INFO ] Implicit Places using invariants in 367 ms returned [736]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 368 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 748/753 places, 539/542 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 747 transition count 538
Applied a total of 2 rules in 23 ms. Remains 747 /748 variables (removed 1) and now considering 538/539 (removed 1) transitions.
// Phase 1: matrix 538 rows 747 cols
[2024-05-29 20:44:42] [INFO ] Computed 329 invariants in 4 ms
[2024-05-29 20:44:43] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-29 20:44:43] [INFO ] Invariant cache hit.
[2024-05-29 20:44:43] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 747/753 places, 538/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1862 ms. Remains : 747/753 places, 538/542 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-10
Product exploration explored 100000 steps with 1720 reset in 603 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-10 finished in 2645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p1))||G(p2))))'
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 14 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2024-05-29 20:44:44] [INFO ] Computed 331 invariants in 6 ms
[2024-05-29 20:44:44] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-29 20:44:44] [INFO ] Invariant cache hit.
[2024-05-29 20:44:45] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-29 20:44:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 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 1295/1295 variables, and 1837 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30020 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 541/2378 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 2378 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30026 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Finished structural reductions in LTL mode , in 1 iterations and 61211 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-11
Product exploration explored 100000 steps with 8 reset in 579 ms.
Product exploration explored 100000 steps with 13 reset in 684 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 p2 (NOT p1)), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
RANDOM walk for 40000 steps (8 resets) in 273 ms. (145 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 283 ms. (140 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 3/3 properties
[2024-05-29 20:45:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 738/753 variables, 325/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 738/1084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1295 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1295 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1837 constraints, problems are : Problem set: 0 solved, 3 unsolved in 428 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 738/753 variables, 325/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 738/1084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1295 variables, 3/1840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1295 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1295 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1840 constraints, problems are : Problem set: 0 solved, 3 unsolved in 688 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1134ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 97074 steps, including 123 resets, run visited all 3 properties in 770 ms. (steps per millisecond=126 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 773 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 9 factoid took 271 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 38 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 20:45:50] [INFO ] Computed 331 invariants in 5 ms
[2024-05-29 20:45:50] [INFO ] Implicit Places using invariants in 409 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 412 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 22 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2024-05-29 20:45:50] [INFO ] Computed 330 invariants in 3 ms
[2024-05-29 20:45:51] [INFO ] Implicit Places using invariants in 369 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 370 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 21 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 20:45:51] [INFO ] Computed 328 invariants in 4 ms
[2024-05-29 20:45:51] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-29 20:45:51] [INFO ] Invariant cache hit.
[2024-05-29 20:45:52] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1878 ms. Remains : 744/753 places, 536/542 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 105 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
RANDOM walk for 40000 steps (8 resets) in 720 ms. (55 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 270 ms. (147 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
[2024-05-29 20:45:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 729/744 variables, 322/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 729/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1280 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 1816 constraints, problems are : Problem set: 0 solved, 3 unsolved in 418 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 729/744 variables, 322/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 729/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 3/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1280 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 1819 constraints, problems are : Problem set: 0 solved, 3 unsolved in 698 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1125ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 11871 steps, including 14 resets, run visited all 3 properties in 97 ms. (steps per millisecond=122 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 98 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 380 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Product exploration explored 100000 steps with 18 reset in 568 ms.
Product exploration explored 100000 steps with 14 reset in 703 ms.
Built C files in :
/tmp/ltsmin4675047072551920143
[2024-05-29 20:45:56] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2024-05-29 20:45:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:45:56] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2024-05-29 20:45:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:45:56] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2024-05-29 20:45:56] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:45:56] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4675047072551920143
Running compilation step : cd /tmp/ltsmin4675047072551920143;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1527 ms.
Running link step : cd /tmp/ltsmin4675047072551920143;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4675047072551920143;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10855074636745679560.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 21 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2024-05-29 20:46:11] [INFO ] Invariant cache hit.
[2024-05-29 20:46:11] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-29 20:46:11] [INFO ] Invariant cache hit.
[2024-05-29 20:46:12] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
[2024-05-29 20:46:12] [INFO ] Redundant transitions in 4 ms returned []
Running 535 sub problems to find dead transitions.
[2024-05-29 20:46:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 743/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/744 variables, 328/1071 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 535 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 1280/1280 variables, and 1816 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30026 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 743/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/744 variables, 328/1071 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 535/2351 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 2351 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30027 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61212 ms. Remains : 744/744 places, 536/536 transitions.
Built C files in :
/tmp/ltsmin14516058365860833282
[2024-05-29 20:47:12] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2024-05-29 20:47:12] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:47:12] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2024-05-29 20:47:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:47:12] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2024-05-29 20:47:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:47:12] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14516058365860833282
Running compilation step : cd /tmp/ltsmin14516058365860833282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1518 ms.
Running link step : cd /tmp/ltsmin14516058365860833282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14516058365860833282;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6703120267610812871.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:47:27] [INFO ] Flatten gal took : 23 ms
[2024-05-29 20:47:27] [INFO ] Flatten gal took : 23 ms
[2024-05-29 20:47:27] [INFO ] Time to serialize gal into /tmp/LTL2930355127952297641.gal : 3 ms
[2024-05-29 20:47:27] [INFO ] Time to serialize properties into /tmp/LTL16433362780095458588.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2930355127952297641.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14838122102800644511.hoa' '-atoms' '/tmp/LTL16433362780095458588.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16433362780095458588.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14838122102800644511.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 20:47:42] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:47:42] [INFO ] Flatten gal took : 20 ms
[2024-05-29 20:47:42] [INFO ] Time to serialize gal into /tmp/LTL7279552559629781607.gal : 3 ms
[2024-05-29 20:47:42] [INFO ] Time to serialize properties into /tmp/LTL13316383162066409374.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7279552559629781607.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13316383162066409374.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("((p58==1)&&(p75==1))")U(X("(((p707==1)&&(p709==1))&&((p578==1)&&(p601==1)))")))||(G("(((p58==0)||(p75==0))||((p707==0)||(p709=...166
Formula 0 simplified : G((!"((p58==1)&&(p75==1))" R X!"(((p707==1)&&(p709==1))&&((p578==1)&&(p601==1)))") & F!"(((p58==0)||(p75==0))||((p707==0)||(p709==0)...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 20:47:58] [INFO ] Flatten gal took : 20 ms
[2024-05-29 20:47:58] [INFO ] Applying decomposition
[2024-05-29 20:47:58] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8017151867040722879.txt' '-o' '/tmp/graph8017151867040722879.bin' '-w' '/tmp/graph8017151867040722879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8017151867040722879.bin' '-l' '-1' '-v' '-w' '/tmp/graph8017151867040722879.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:47:58] [INFO ] Decomposing Gal with order
[2024-05-29 20:47:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:47:58] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-29 20:47:58] [INFO ] Flatten gal took : 31 ms
[2024-05-29 20:47:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 15 ms.
[2024-05-29 20:47:58] [INFO ] Time to serialize gal into /tmp/LTL6512023180172872511.gal : 8 ms
[2024-05-29 20:47:58] [INFO ] Time to serialize properties into /tmp/LTL9530386842740251487.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6512023180172872511.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9530386842740251487.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((("((i1.u18.p58==1)&&(i0.i1.i3.u23.p75==1))")U(X("(((i18.i1.i0.u226.p707==1)&&(i18.i1.i0.u226.p709==1))&&((i14.i0.i0.u185.p578==1...296
Formula 0 simplified : G((!"((i1.u18.p58==1)&&(i0.i1.i3.u23.p75==1))" R X!"(((i18.i1.i0.u226.p707==1)&&(i18.i1.i0.u226.p709==1))&&((i14.i0.i0.u185.p578==1)...289
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-030A-LTLFireability-11 finished in 208759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 9 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2024-05-29 20:48:13] [INFO ] Computed 331 invariants in 4 ms
[2024-05-29 20:48:13] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-29 20:48:13] [INFO ] Invariant cache hit.
[2024-05-29 20:48:14] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-29 20:48:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 1837 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30023 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 752/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/752 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 1/753 variables, 331/1083 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/753 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/1295 variables, 753/1837 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 541/2378 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 2378 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30025 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Finished structural reductions in LTL mode , in 1 iterations and 61193 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-13
Product exploration explored 100000 steps with 3 reset in 650 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-13 finished in 62011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 25 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 20:49:15] [INFO ] Computed 331 invariants in 5 ms
[2024-05-29 20:49:15] [INFO ] Implicit Places using invariants in 404 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 405 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 17 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2024-05-29 20:49:15] [INFO ] Computed 330 invariants in 3 ms
[2024-05-29 20:49:16] [INFO ] Implicit Places using invariants in 366 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 367 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 21 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 20:49:16] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 20:49:16] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-29 20:49:16] [INFO ] Invariant cache hit.
[2024-05-29 20:49:17] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1838 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 543 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-15 finished in 2447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p0)))||F((G(F(p1))||(F(p1)&&p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p1))||G(p2))))'
Found a Shortening insensitive property : ShieldPPPt-PT-030A-LTLFireability-11
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 25 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 20:49:18] [INFO ] Computed 331 invariants in 6 ms
[2024-05-29 20:49:18] [INFO ] Implicit Places using invariants in 403 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 404 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 15 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2024-05-29 20:49:18] [INFO ] Computed 330 invariants in 4 ms
[2024-05-29 20:49:18] [INFO ] Implicit Places using invariants in 387 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 388 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 19 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 20:49:18] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 20:49:19] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-29 20:49:19] [INFO ] Invariant cache hit.
[2024-05-29 20:49:19] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 1887 ms. Remains : 744/753 places, 536/542 transitions.
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-11
Product exploration explored 100000 steps with 12 reset in 530 ms.
Product exploration explored 100000 steps with 16 reset in 677 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 p2 (NOT p1)), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
RANDOM walk for 40000 steps (8 resets) in 281 ms. (141 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
[2024-05-29 20:49:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 729/744 variables, 322/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 729/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1280 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 1816 constraints, problems are : Problem set: 0 solved, 3 unsolved in 442 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 729/744 variables, 322/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 729/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 3/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1280 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 1819 constraints, problems are : Problem set: 0 solved, 3 unsolved in 646 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1096ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 9384 steps, including 11 resets, run visited all 3 properties in 77 ms. (steps per millisecond=121 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 78 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 9 factoid took 281 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 16 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2024-05-29 20:49:23] [INFO ] Invariant cache hit.
[2024-05-29 20:49:23] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-29 20:49:23] [INFO ] Invariant cache hit.
[2024-05-29 20:49:24] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
[2024-05-29 20:49:24] [INFO ] Redundant transitions in 4 ms returned []
Running 535 sub problems to find dead transitions.
[2024-05-29 20:49:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 743/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/744 variables, 328/1071 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 1816 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30022 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 743/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/744 variables, 328/1071 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 535/2351 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 2351 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30022 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61177 ms. Remains : 744/744 places, 536/536 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 157 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
RANDOM walk for 40000 steps (8 resets) in 895 ms. (44 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 256 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 3/3 properties
[2024-05-29 20:50:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 729/744 variables, 322/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 729/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1280 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 1816 constraints, problems are : Problem set: 0 solved, 3 unsolved in 413 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 729/744 variables, 322/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 729/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 3/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1280 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 1819 constraints, problems are : Problem set: 0 solved, 3 unsolved in 675 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1109ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 5510 steps, including 6 resets, run visited all 3 properties in 51 ms. (steps per millisecond=108 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 52 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 285 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Product exploration explored 100000 steps with 21 reset in 582 ms.
Product exploration explored 100000 steps with 12 reset in 709 ms.
Built C files in :
/tmp/ltsmin2887612932645121138
[2024-05-29 20:50:28] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2024-05-29 20:50:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:50:28] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2024-05-29 20:50:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:50:28] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2024-05-29 20:50:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:50:29] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2887612932645121138
Running compilation step : cd /tmp/ltsmin2887612932645121138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1515 ms.
Running link step : cd /tmp/ltsmin2887612932645121138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2887612932645121138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7526135896283873307.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 24 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2024-05-29 20:50:44] [INFO ] Invariant cache hit.
[2024-05-29 20:50:44] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-29 20:50:44] [INFO ] Invariant cache hit.
[2024-05-29 20:50:45] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2024-05-29 20:50:45] [INFO ] Redundant transitions in 3 ms returned []
Running 535 sub problems to find dead transitions.
[2024-05-29 20:50:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 743/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/744 variables, 328/1071 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 1816 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30015 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 743/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/744 variables, 328/1071 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 5 (OVERLAPS) 536/1280 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 535/2351 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 2351 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30021 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61279 ms. Remains : 744/744 places, 536/536 transitions.
Built C files in :
/tmp/ltsmin7441674199414031117
[2024-05-29 20:51:45] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2024-05-29 20:51:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:51:45] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2024-05-29 20:51:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:51:45] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2024-05-29 20:51:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:51:45] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7441674199414031117
Running compilation step : cd /tmp/ltsmin7441674199414031117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1529 ms.
Running link step : cd /tmp/ltsmin7441674199414031117;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin7441674199414031117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18135533589312825959.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:52:00] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:52:00] [INFO ] Flatten gal took : 20 ms
[2024-05-29 20:52:00] [INFO ] Time to serialize gal into /tmp/LTL2246125087861656654.gal : 3 ms
[2024-05-29 20:52:00] [INFO ] Time to serialize properties into /tmp/LTL12990710272743941700.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2246125087861656654.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17447871094649250551.hoa' '-atoms' '/tmp/LTL12990710272743941700.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12990710272743941700.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17447871094649250551.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 20:52:15] [INFO ] Flatten gal took : 22 ms
[2024-05-29 20:52:15] [INFO ] Flatten gal took : 20 ms
[2024-05-29 20:52:15] [INFO ] Time to serialize gal into /tmp/LTL10657219651622797619.gal : 3 ms
[2024-05-29 20:52:15] [INFO ] Time to serialize properties into /tmp/LTL5283320888646525820.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10657219651622797619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5283320888646525820.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("((p58==1)&&(p75==1))")U(X("(((p707==1)&&(p709==1))&&((p578==1)&&(p601==1)))")))||(G("(((p58==0)||(p75==0))||((p707==0)||(p709=...166
Formula 0 simplified : G((!"((p58==1)&&(p75==1))" R X!"(((p707==1)&&(p709==1))&&((p578==1)&&(p601==1)))") & F!"(((p58==0)||(p75==0))||((p707==0)||(p709==0)...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 20:52:30] [INFO ] Flatten gal took : 23 ms
[2024-05-29 20:52:30] [INFO ] Applying decomposition
[2024-05-29 20:52:30] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13782636889103380839.txt' '-o' '/tmp/graph13782636889103380839.bin' '-w' '/tmp/graph13782636889103380839.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13782636889103380839.bin' '-l' '-1' '-v' '-w' '/tmp/graph13782636889103380839.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:52:30] [INFO ] Decomposing Gal with order
[2024-05-29 20:52:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:52:30] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-29 20:52:30] [INFO ] Flatten gal took : 29 ms
[2024-05-29 20:52:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 21 ms.
[2024-05-29 20:52:30] [INFO ] Time to serialize gal into /tmp/LTL3223822585058248601.gal : 8 ms
[2024-05-29 20:52:30] [INFO ] Time to serialize properties into /tmp/LTL15429300713561795153.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3223822585058248601.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15429300713561795153.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((("((i1.i1.i1.u18.p58==1)&&(i1.i0.i0.u23.p75==1))")U(X("(((i18.i0.i1.u226.p707==1)&&(i18.i0.i1.u226.p709==1))&&((i14.u185.p578==1...296
Formula 0 simplified : G((!"((i1.i1.i1.u18.p58==1)&&(i1.i0.i0.u23.p75==1))" R X!"(((i18.i0.i1.u226.p707==1)&&(i18.i0.i1.u226.p709==1))&&((i14.u185.p578==1)...289
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-030A-LTLFireability-11 finished in 207981 ms.
[2024-05-29 20:52:45] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6616423521749854249
[2024-05-29 20:52:45] [INFO ] Computing symmetric may disable matrix : 542 transitions.
[2024-05-29 20:52:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:52:45] [INFO ] Computing symmetric may enable matrix : 542 transitions.
[2024-05-29 20:52:45] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:52:45] [INFO ] Applying decomposition
[2024-05-29 20:52:46] [INFO ] Flatten gal took : 40 ms
[2024-05-29 20:52:46] [INFO ] Computing Do-Not-Accords matrix : 542 transitions.
[2024-05-29 20:52:46] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:52:46] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6616423521749854249
Running compilation step : cd /tmp/ltsmin6616423521749854249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5063323564860077784.txt' '-o' '/tmp/graph5063323564860077784.bin' '-w' '/tmp/graph5063323564860077784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5063323564860077784.bin' '-l' '-1' '-v' '-w' '/tmp/graph5063323564860077784.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:52:46] [INFO ] Decomposing Gal with order
[2024-05-29 20:52:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:52:46] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-29 20:52:46] [INFO ] Flatten gal took : 44 ms
[2024-05-29 20:52:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 36 ms.
[2024-05-29 20:52:46] [INFO ] Time to serialize gal into /tmp/LTLFireability8770600699880503662.gal : 23 ms
[2024-05-29 20:52:46] [INFO ] Time to serialize properties into /tmp/LTLFireability18026842424750362.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8770600699880503662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18026842424750362.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 2 LTL properties
Checking formula 0 : !(((G(("(i6.i2.i0.u88.p276!=1)")&&(X("(i6.i2.i0.u88.p276!=1)"))))||(F((G(F("(i4.i0.i0.u48.p151==1)")))||(("((i19.u218.p680==1)&&(i19.u...206
Formula 0 simplified : F(!"(i6.i2.i0.u88.p276!=1)" | X!"(i6.i2.i0.u88.p276!=1)") & G(FG!"(i4.i0.i0.u48.p151==1)" & (!"((i19.u218.p680==1)&&(i19.u222.p697==...190
Compilation finished in 1715 ms.
Running link step : cd /tmp/ltsmin6616423521749854249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin6616423521749854249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)&&X((LTLAPp0==true))))||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.061: LTL layer: formula: ([](((LTLAPp0==true)&&X((LTLAPp0==true))))||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&(LTLAPp2==true)))))
pins2lts-mc-linux64( 0/ 8), 0.062: "([](((LTLAPp0==true)&&X((LTLAPp0==true))))||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&(LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.062: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.061: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.061: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.083: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.083: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.065: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.083: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.083: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.099: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.124: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.129: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.140: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.171: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.181: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.243: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.248: buchi has 4 states
pins2lts-mc-linux64( 1/ 8), 0.249: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.326: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.762: DFS-FIFO for weak LTL, using special progress label 549
pins2lts-mc-linux64( 0/ 8), 0.762: There are 550 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.762: State length is 754, there are 551 groups
pins2lts-mc-linux64( 0/ 8), 0.762: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.762: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.762: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.762: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 2.279: ~1 levels ~960 states ~3872 transitions
pins2lts-mc-linux64( 7/ 8), 2.388: ~1 levels ~1920 states ~8704 transitions
pins2lts-mc-linux64( 7/ 8), 2.556: ~1 levels ~3840 states ~19392 transitions
pins2lts-mc-linux64( 7/ 8), 3.296: ~1 levels ~7680 states ~42976 transitions
pins2lts-mc-linux64( 0/ 8), 4.262: ~1 levels ~15360 states ~118032 transitions
pins2lts-mc-linux64( 7/ 8), 6.115: ~1 levels ~30720 states ~209472 transitions
pins2lts-mc-linux64( 7/ 8), 8.284: ~1 levels ~61440 states ~437184 transitions
pins2lts-mc-linux64( 4/ 8), 10.956: ~1 levels ~122880 states ~1009976 transitions
pins2lts-mc-linux64( 7/ 8), 16.689: ~1 levels ~245760 states ~1963256 transitions
pins2lts-mc-linux64( 7/ 8), 38.483: ~1 levels ~491520 states ~4277200 transitions
pins2lts-mc-linux64( 7/ 8), 55.262: ~1 levels ~983040 states ~8752544 transitions
pins2lts-mc-linux64( 7/ 8), 82.371: ~1 levels ~1966080 states ~18792024 transitions
pins2lts-mc-linux64( 7/ 8), 136.589: ~1 levels ~3932160 states ~38810192 transitions
pins2lts-mc-linux64( 1/ 8), 239.923: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 240.049:
pins2lts-mc-linux64( 0/ 8), 240.049: mean standard work distribution: 1.7% (states) 2.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 240.049:
pins2lts-mc-linux64( 0/ 8), 240.049: Explored 6834299 states 75207928 transitions, fanout: 11.004
pins2lts-mc-linux64( 0/ 8), 240.049: Total exploration time 239.240 sec (239.090 sec minimum, 239.164 sec on average)
pins2lts-mc-linux64( 0/ 8), 240.049: States per second: 28567, Transitions per second: 314362
pins2lts-mc-linux64( 0/ 8), 240.049:
pins2lts-mc-linux64( 0/ 8), 240.049: Progress states detected: 14433808
pins2lts-mc-linux64( 0/ 8), 240.049: Redundant explorations: -52.6510
pins2lts-mc-linux64( 0/ 8), 240.049:
pins2lts-mc-linux64( 0/ 8), 240.049: Queue width: 8B, total height: 12070548, memory: 92.09MB
pins2lts-mc-linux64( 0/ 8), 240.049: Tree memory: 366.1MB, 26.6 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 240.049: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 240.049: Stored 548 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 240.049: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 240.049: Est. total memory use: 458.2MB (~1116.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6616423521749854249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)&&X((LTLAPp0==true))))||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6616423521749854249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)&&X((LTLAPp0==true))))||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
5 unique states visited
5 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
11463 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,114.743,1700628,1,0,2.3527e+06,718,4037,1.13892e+07,124,5283,843870
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((("((i1.i1.i1.u18.p58==1)&&(i1.i1.i0.u23.p75==1))")U(X("(((i20.i0.i3.u226.p707==1)&&(i20.i0.i3.u226.p709==1))&&((i15.i2.i0.u185.p...308
Formula 1 simplified : G((!"((i1.i1.i1.u18.p58==1)&&(i1.i1.i0.u23.p75==1))" R X!"(((i20.i0.i3.u226.p707==1)&&(i20.i0.i3.u226.p709==1))&&((i15.i2.i0.u185.p5...301
Detected timeout of ITS tools.
[2024-05-29 21:19:04] [INFO ] Applying decomposition
[2024-05-29 21:19:04] [INFO ] Flatten gal took : 20 ms
[2024-05-29 21:19:04] [INFO ] Decomposing Gal with order
[2024-05-29 21:19:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:19:04] [INFO ] Removed a total of 180 redundant transitions.
[2024-05-29 21:19:04] [INFO ] Flatten gal took : 35 ms
[2024-05-29 21:19:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-29 21:19:04] [INFO ] Time to serialize gal into /tmp/LTLFireability17806774605342752738.gal : 7 ms
[2024-05-29 21:19:04] [INFO ] Time to serialize properties into /tmp/LTLFireability4743031316517337575.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17806774605342752738.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4743031316517337575.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((("((i18.u33.p58==1)&&(u42.p75==1))")U(X("(((i226.u396.p707==1)&&(i226.u397.p709==1))&&((u324.p578==1)&&(u337.p601==1)))")))||(G(...240
Formula 0 simplified : G((!"((i18.u33.p58==1)&&(u42.p75==1))" R X!"(((i226.u396.p707==1)&&(i226.u397.p709==1))&&((u324.p578==1)&&(u337.p601==1)))") & F!"((...233
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9188 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,92.0055,2210656,1,0,4.41836e+06,830,3394,9.88639e+06,34,638,627477
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 2805927 ms.

BK_STOP 1717017638359

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-030A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-030A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761500644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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