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-171683761600659.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-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761600659
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.9K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 15:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 15:06 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 268K 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-040A-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-040A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717018541128

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 21:35:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 21:35:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 21:35:42] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2024-05-29 21:35:42] [INFO ] Transformed 1003 places.
[2024-05-29 21:35:42] [INFO ] Transformed 723 transitions.
[2024-05-29 21:35:42] [INFO ] Found NUPN structural information;
[2024-05-29 21:35:42] [INFO ] Parsed PT model containing 1003 places and 723 transitions and 2886 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 101 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 21:35:42] [INFO ] Computed 441 invariants in 26 ms
[2024-05-29 21:35:43] [INFO ] Implicit Places using invariants in 791 ms returned []
[2024-05-29 21:35:43] [INFO ] Invariant cache hit.
[2024-05-29 21:35:44] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
Running 721 sub problems to find dead transitions.
[2024-05-29 21:35:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1725 variables, and 1444 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30052 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 721 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 5 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1725 variables, 721/3168 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 3168 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30020 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
After SMT, in 60388ms problems are : Problem set: 0 solved, 721 unsolved
Search for dead transitions found 0 dead transitions in 60505ms
Finished structural reductions in LTL mode , in 1 iterations and 62391 ms. Remains : 1003/1003 places, 722/722 transitions.
Support contains 17 out of 1003 places after structural reductions.
[2024-05-29 21:36:45] [INFO ] Flatten gal took : 132 ms
[2024-05-29 21:36:45] [INFO ] Flatten gal took : 60 ms
[2024-05-29 21:36:45] [INFO ] Input system was already deterministic with 722 transitions.
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (8 resets) in 1853 ms. (21 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 481 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 342 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 392 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 6/6 properties
[2024-05-29 21:36:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 29/43 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 29/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 960/1003 variables, 425/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 960/1444 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1725 variables, 0/2447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1725 variables, 0/2447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1725/1725 variables, and 2447 constraints, problems are : Problem set: 0 solved, 6 unsolved in 808 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 29/43 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 29/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 960/1003 variables, 425/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 960/1444 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1725 variables, 6/2453 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1725 variables, 0/2453 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1725 variables, 0/2453 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 2453 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1504 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2324ms problems are : Problem set: 0 solved, 6 unsolved
Finished Parikh walk after 43611 steps, including 70 resets, run visited all 6 properties in 1030 ms. (steps per millisecond=42 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 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 2 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 1042 ms.
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' '!(G((X(X((F(G(p0))&&p1)))||(F(X(X(p2))) U p1))))'
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 25 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 21:36:50] [INFO ] Invariant cache hit.
[2024-05-29 21:36:51] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-05-29 21:36:51] [INFO ] Invariant cache hit.
[2024-05-29 21:36:52] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
Running 721 sub problems to find dead transitions.
[2024-05-29 21:36:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 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 1003/1725 variables, and 1444 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30019 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 721 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 5 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1725 variables, 721/3168 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 3168 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30026 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
After SMT, in 60304ms problems are : Problem set: 0 solved, 721 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Finished structural reductions in LTL mode , in 1 iterations and 61847 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 388 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 693 ms.
Product exploration explored 100000 steps with 0 reset in 846 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p1), (X (X p2)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 92 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 570 ms. (70 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 2/2 properties
[2024-05-29 21:37:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 11/14 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 989/1003 variables, 436/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 989/1444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1725 variables, 0/2447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1725 variables, 0/2447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1725/1725 variables, and 2447 constraints, problems are : Problem set: 0 solved, 2 unsolved in 476 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 11/14 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 989/1003 variables, 436/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 989/1444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1725 variables, 2/2449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1725 variables, 0/2449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1725 variables, 0/2449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 2449 constraints, problems are : Problem set: 0 solved, 2 unsolved in 840 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1327ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 42253 steps, including 79 resets, run visited all 2 properties in 704 ms. (steps per millisecond=60 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 705 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p1), (X (X p2)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F p2), (F (NOT p1)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 6 factoid took 354 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 28 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 21:37:58] [INFO ] Invariant cache hit.
[2024-05-29 21:37:58] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-29 21:37:58] [INFO ] Invariant cache hit.
[2024-05-29 21:37:59] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
Running 721 sub problems to find dead transitions.
[2024-05-29 21:37:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 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 1003/1725 variables, and 1444 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30017 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 721 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 5 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1725 variables, 721/3168 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 3168 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30028 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 721 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Finished structural reductions in LTL mode , in 1 iterations and 61610 ms. Remains : 1003/1003 places, 722/722 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 p1 (NOT p2) p0), (X p1), (X (X p2)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 518 ms. (77 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 275 ms. (144 steps per ms) remains 2/2 properties
[2024-05-29 21:39:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 11/14 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 989/1003 variables, 436/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 989/1444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1725 variables, 0/2447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1725 variables, 0/2447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1725/1725 variables, and 2447 constraints, problems are : Problem set: 0 solved, 2 unsolved in 463 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 11/14 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 989/1003 variables, 436/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 989/1444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1725 variables, 2/2449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1725 variables, 0/2449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1725 variables, 0/2449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 2449 constraints, problems are : Problem set: 0 solved, 2 unsolved in 781 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1256ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 41209 steps, including 76 resets, run visited all 2 properties in 682 ms. (steps per millisecond=60 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 685 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p1), (X (X p2)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F p2), (F (NOT p1)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 6 factoid took 365 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 605 ms.
Product exploration explored 100000 steps with 0 reset in 837 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 289 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1003 transition count 722
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 146 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 21:39:05] [INFO ] Redundant transitions in 34 ms returned []
Running 721 sub problems to find dead transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 21:39:05] [INFO ] Computed 441 invariants in 9 ms
[2024-05-29 21:39:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1725 variables, and 1444 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30020 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 721 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
[2024-05-29 21:39:49] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 11 ms to minimize.
Problem TDEAD278 is UNSAT
[2024-05-29 21:39:49] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD279 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 2/1446 constraints. Problems are: Problem set: 2 solved, 719 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1003 variables, 0/1446 constraints. Problems are: Problem set: 2 solved, 719 unsolved
SMT process timed out in 60237ms, After SMT, problems are : Problem set: 2 solved, 719 unsolved
Search for dead transitions found 2 dead transitions in 60245ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1003 places, 720/722 transitions.
Graph (complete) has 2442 edges and 1003 vertex of which 1001 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 40 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/720 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1001/1003 places, 720/722 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60478 ms. Remains : 1001/1003 places, 720/722 transitions.
Built C files in :
/tmp/ltsmin18200310224737635119
[2024-05-29 21:40:06] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18200310224737635119
Running compilation step : cd /tmp/ltsmin18200310224737635119;'/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 1659 ms.
Running link step : cd /tmp/ltsmin18200310224737635119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin18200310224737635119;'/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' '--hoa' '/tmp/stateBased3444542830384053918.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 19 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 21:40:21] [INFO ] Computed 441 invariants in 9 ms
[2024-05-29 21:40:21] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-29 21:40:21] [INFO ] Invariant cache hit.
[2024-05-29 21:40:22] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
Running 721 sub problems to find dead transitions.
[2024-05-29 21:40:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1725 variables, and 1444 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30018 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 721 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 5 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1725 variables, 721/3168 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 3168 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30037 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 721 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Finished structural reductions in LTL mode , in 1 iterations and 61634 ms. Remains : 1003/1003 places, 722/722 transitions.
Built C files in :
/tmp/ltsmin15161472063406402297
[2024-05-29 21:41:22] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15161472063406402297
Running compilation step : cd /tmp/ltsmin15161472063406402297;'/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 1789 ms.
Running link step : cd /tmp/ltsmin15161472063406402297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15161472063406402297;'/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' '--hoa' '/tmp/stateBased3246516599762694453.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 21:41:38] [INFO ] Flatten gal took : 47 ms
[2024-05-29 21:41:38] [INFO ] Flatten gal took : 47 ms
[2024-05-29 21:41:38] [INFO ] Time to serialize gal into /tmp/LTL5238602341987246892.gal : 8 ms
[2024-05-29 21:41:38] [INFO ] Time to serialize properties into /tmp/LTL17995530034701091345.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/LTL5238602341987246892.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12761403329764954524.hoa' '-atoms' '/tmp/LTL17995530034701091345.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/LTL17995530034701091345.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12761403329764954524.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 21:41:53] [INFO ] Flatten gal took : 37 ms
[2024-05-29 21:41:53] [INFO ] Flatten gal took : 38 ms
[2024-05-29 21:41:53] [INFO ] Time to serialize gal into /tmp/LTL14209121868506037278.gal : 12 ms
[2024-05-29 21:41:53] [INFO ] Time to serialize properties into /tmp/LTL15449944376019178706.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/LTL14209121868506037278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15449944376019178706.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...277
Read 1 LTL properties
Checking formula 0 : !((G((X(X((F(G("((p646==0)||(p82==1))")))&&("((p389==0)||(p465==1))"))))||((F(X(X("(p755==1)"))))U("((p389==0)||(p465==1))")))))
Formula 0 simplified : F(!"((p389==0)||(p465==1))" & X(X(!"((p389==0)||(p465==1))" | GF!"((p646==0)||(p82==1))") & (!"((p389==0)||(p465==1))" W XG!"(p755==...161
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 21:42:08] [INFO ] Flatten gal took : 37 ms
[2024-05-29 21:42:08] [INFO ] Applying decomposition
[2024-05-29 21:42:08] [INFO ] Flatten gal took : 34 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/graph7939429675852565848.txt' '-o' '/tmp/graph7939429675852565848.bin' '-w' '/tmp/graph7939429675852565848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7939429675852565848.bin' '-l' '-1' '-v' '-w' '/tmp/graph7939429675852565848.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:42:08] [INFO ] Decomposing Gal with order
[2024-05-29 21:42:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:42:08] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-29 21:42:08] [INFO ] Flatten gal took : 79 ms
[2024-05-29 21:42:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 79 ms.
[2024-05-29 21:42:08] [INFO ] Time to serialize gal into /tmp/LTL1744819997952113711.gal : 18 ms
[2024-05-29 21:42:08] [INFO ] Time to serialize properties into /tmp/LTL12729752066504720604.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/LTL1744819997952113711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12729752066504720604.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((X(X((F(G("((i14.i0.i1.u205.p646==0)||(i2.i0.i1.u26.p82==1))")))&&("((i8.u123.p389==0)||(i11.i0.i0.u148.p465==1))"))))||((F(X(X("...238
Formula 0 simplified : F(!"((i8.u123.p389==0)||(i11.i0.i0.u148.p465==1))" & X(X(!"((i8.u123.p389==0)||(i11.i0.i0.u148.p465==1))" | GF!"((i14.i0.i1.u205.p64...273
Detected timeout of ITS tools.
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-03 finished in 333515 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(F(p0)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 18 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 21:42:23] [INFO ] Invariant cache hit.
[2024-05-29 21:42:24] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-29 21:42:24] [INFO ] Invariant cache hit.
[2024-05-29 21:42:25] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
Running 721 sub problems to find dead transitions.
[2024-05-29 21:42:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1725 variables, and 1444 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30019 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 721 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 5 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1725 variables, 721/3168 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 3168 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30026 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 721 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Finished structural reductions in LTL mode , in 1 iterations and 61698 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 2162 ms.
Product exploration explored 100000 steps with 50000 reset in 2225 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040A-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-06 finished in 66196 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((!p1 U (!p2||(p3&&X((p3 U (!p4||G(p3)))))||G(!p1))))&&p0)))'
Support contains 8 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 18 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-29 21:43:30] [INFO ] Invariant cache hit.
[2024-05-29 21:43:30] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-29 21:43:30] [INFO ] Invariant cache hit.
[2024-05-29 21:43:31] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
Running 721 sub problems to find dead transitions.
[2024-05-29 21:43:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1725 variables, and 1444 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30014 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 721 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 5 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1725 variables, 721/3168 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 3168 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30024 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 721 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Finished structural reductions in LTL mode , in 1 iterations and 61602 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (OR (NOT p0) (AND p1 p2 (NOT p3))), (OR (NOT p0) (AND p1 p2 (NOT p3))), (AND p1 p2 (NOT p3)), (AND (NOT p3) p4), (AND p2 (NOT p3) p1 p4)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-08 finished in 61935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 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 1001 transition count 720
Applied a total of 4 rules in 55 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2024-05-29 21:44:32] [INFO ] Computed 441 invariants in 7 ms
[2024-05-29 21:44:32] [INFO ] Implicit Places using invariants in 543 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 545 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 720/722 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 1000 transition count 718
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 998 transition count 718
Applied a total of 4 rules in 48 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2024-05-29 21:44:32] [INFO ] Computed 440 invariants in 3 ms
[2024-05-29 21:44:33] [INFO ] Implicit Places using invariants in 527 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 528 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/1003 places, 718/722 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 994 transition count 716
Applied a total of 4 rules in 39 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2024-05-29 21:44:33] [INFO ] Computed 438 invariants in 7 ms
[2024-05-29 21:44:33] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-29 21:44:33] [INFO ] Invariant cache hit.
[2024-05-29 21:44:34] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1455 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 994/1003 places, 716/722 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2671 ms. Remains : 994/1003 places, 716/722 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-11
Product exploration explored 100000 steps with 2 reset in 643 ms.
Product exploration explored 100000 steps with 0 reset in 828 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
[2024-05-29 21:44:36] [INFO ] Invariant cache hit.
[2024-05-29 21:44:37] [INFO ] [Real]Absence check using 438 positive place invariants in 236 ms returned sat
[2024-05-29 21:44:37] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2024-05-29 21:44:37] [INFO ] Computed and/alt/rep : 715/2227/715 causal constraints (skipped 0 transitions) in 41 ms.
[2024-05-29 21:44:37] [INFO ] Added : 0 causal constraints over 0 iterations in 106 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 994 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 32 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-29 21:44:38] [INFO ] Invariant cache hit.
[2024-05-29 21:44:38] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-29 21:44:38] [INFO ] Invariant cache hit.
[2024-05-29 21:44:39] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
[2024-05-29 21:44:39] [INFO ] Redundant transitions in 7 ms returned []
Running 715 sub problems to find dead transitions.
[2024-05-29 21:44:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/993 variables, 993/993 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/993 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/994 variables, 438/1431 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/994 variables, 1/1432 constraints. Problems are: Problem set: 0 solved, 715 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 994/1710 variables, and 1432 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30015 ms.
Refiners :[Domain max(s): 994/994 constraints, Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 0/994 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/993 variables, 993/993 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/993 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/994 variables, 438/1431 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/994 variables, 1/1432 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/994 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (OVERLAPS) 716/1710 variables, 994/2426 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1710 variables, 715/3141 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1710/1710 variables, and 3141 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30020 ms.
Refiners :[Domain max(s): 994/994 constraints, Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 994/994 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61600 ms. Remains : 994/994 places, 716/716 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-05-29 21:45:39] [INFO ] Invariant cache hit.
[2024-05-29 21:45:40] [INFO ] [Real]Absence check using 438 positive place invariants in 226 ms returned sat
[2024-05-29 21:45:40] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2024-05-29 21:45:40] [INFO ] Computed and/alt/rep : 715/2227/715 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-29 21:45:41] [INFO ] Added : 0 causal constraints over 0 iterations in 104 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 637 ms.
Product exploration explored 100000 steps with 0 reset in 847 ms.
Built C files in :
/tmp/ltsmin10414604547199719827
[2024-05-29 21:45:42] [INFO ] Computing symmetric may disable matrix : 716 transitions.
[2024-05-29 21:45:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:45:42] [INFO ] Computing symmetric may enable matrix : 716 transitions.
[2024-05-29 21:45:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:45:42] [INFO ] Computing Do-Not-Accords matrix : 716 transitions.
[2024-05-29 21:45:42] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:45:42] [INFO ] Built C files in 129ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10414604547199719827
Running compilation step : cd /tmp/ltsmin10414604547199719827;'/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 2201 ms.
Running link step : cd /tmp/ltsmin10414604547199719827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10414604547199719827;'/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/stateBased3476611626570308215.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 994 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 994/994 places, 716/716 transitions.
Applied a total of 0 rules in 21 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-29 21:45:57] [INFO ] Invariant cache hit.
[2024-05-29 21:45:58] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-05-29 21:45:58] [INFO ] Invariant cache hit.
[2024-05-29 21:45:59] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1373 ms to find 0 implicit places.
[2024-05-29 21:45:59] [INFO ] Redundant transitions in 5 ms returned []
Running 715 sub problems to find dead transitions.
[2024-05-29 21:45:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/993 variables, 993/993 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/993 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/994 variables, 438/1431 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/994 variables, 1/1432 constraints. Problems are: Problem set: 0 solved, 715 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 994/1710 variables, and 1432 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30015 ms.
Refiners :[Domain max(s): 994/994 constraints, Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 0/994 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/993 variables, 993/993 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/993 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (OVERLAPS) 1/994 variables, 438/1431 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/994 variables, 1/1432 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/994 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 5 (OVERLAPS) 716/1710 variables, 994/2426 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1710 variables, 715/3141 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1710/1710 variables, and 3141 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30023 ms.
Refiners :[Domain max(s): 994/994 constraints, Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 994/994 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 0/0 constraints]
After SMT, in 60194ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61609 ms. Remains : 994/994 places, 716/716 transitions.
Built C files in :
/tmp/ltsmin3167431275203336258
[2024-05-29 21:46:59] [INFO ] Computing symmetric may disable matrix : 716 transitions.
[2024-05-29 21:46:59] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:46:59] [INFO ] Computing symmetric may enable matrix : 716 transitions.
[2024-05-29 21:46:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:46:59] [INFO ] Computing Do-Not-Accords matrix : 716 transitions.
[2024-05-29 21:46:59] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:46:59] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3167431275203336258
Running compilation step : cd /tmp/ltsmin3167431275203336258;'/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 2186 ms.
Running link step : cd /tmp/ltsmin3167431275203336258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3167431275203336258;'/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/stateBased3054075330247350037.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 21:47:14] [INFO ] Flatten gal took : 32 ms
[2024-05-29 21:47:14] [INFO ] Flatten gal took : 32 ms
[2024-05-29 21:47:14] [INFO ] Time to serialize gal into /tmp/LTL4841079810965159431.gal : 4 ms
[2024-05-29 21:47:14] [INFO ] Time to serialize properties into /tmp/LTL17276016806562867870.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/LTL4841079810965159431.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17028234843190565657.hoa' '-atoms' '/tmp/LTL17276016806562867870.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/LTL17276016806562867870.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17028234843190565657.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1041 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,10.5036,234796,1,0,8,1.23723e+06,24,0,24251,560119,29
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-11 finished in 173713 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))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 17 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2024-05-29 21:47:25] [INFO ] Computed 441 invariants in 6 ms
[2024-05-29 21:47:26] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-29 21:47:26] [INFO ] Invariant cache hit.
[2024-05-29 21:47:27] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
Running 721 sub problems to find dead transitions.
[2024-05-29 21:47:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 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 1003/1725 variables, and 1444 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30017 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 721 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 441/1443 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 5 (OVERLAPS) 722/1725 variables, 1003/2447 constraints. Problems are: Problem set: 0 solved, 721 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1725 variables, 721/3168 constraints. Problems are: Problem set: 0 solved, 721 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 3168 constraints, problems are : Problem set: 0 solved, 721 unsolved in 30023 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 721/721 constraints, Known Traps: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 721 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Finished structural reductions in LTL mode , in 1 iterations and 61556 ms. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 2325 ms.
Product exploration explored 100000 steps with 50000 reset in 2412 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040A-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-13 finished in 66417 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((X(X((F(G(p0))&&p1)))||(F(X(X(p2))) U p1))))'
[2024-05-29 21:48:32] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
[2024-05-29 21:48:32] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin13479348555423573586
[2024-05-29 21:48:32] [INFO ] Computing symmetric may disable matrix : 722 transitions.
[2024-05-29 21:48:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:48:32] [INFO ] Computing symmetric may enable matrix : 722 transitions.
[2024-05-29 21:48:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:48:32] [INFO ] Flatten gal took : 59 ms
[2024-05-29 21:48:32] [INFO ] Computing Do-Not-Accords matrix : 722 transitions.
[2024-05-29 21:48:32] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:48:32] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13479348555423573586
Running compilation step : cd /tmp/ltsmin13479348555423573586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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/graph1770318412277673077.txt' '-o' '/tmp/graph1770318412277673077.bin' '-w' '/tmp/graph1770318412277673077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1770318412277673077.bin' '-l' '-1' '-v' '-w' '/tmp/graph1770318412277673077.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:48:32] [INFO ] Decomposing Gal with order
[2024-05-29 21:48:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:48:32] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-29 21:48:32] [INFO ] Flatten gal took : 42 ms
[2024-05-29 21:48:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 23 ms.
[2024-05-29 21:48:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality10373393939851585127.gal : 10 ms
[2024-05-29 21:48:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality17920197974834105923.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/LTLCardinality10373393939851585127.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17920197974834105923.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...278
Read 1 LTL properties
Checking formula 0 : !((G((X(X((F(G("((i14.i2.i1.u205.p646==0)||(i2.u26.p82==1))")))&&("((i8.i0.i2.u123.p389==0)||(i10.i0.i3.u148.p465==1))"))))||((F(X(X("...238
Formula 0 simplified : F(!"((i8.i0.i2.u123.p389==0)||(i10.i0.i3.u148.p465==1))" & X(X(!"((i8.i0.i2.u123.p389==0)||(i10.i0.i3.u148.p465==1))" | GF!"((i14.i2...279
Compilation finished in 2424 ms.
Running link step : cd /tmp/ltsmin13479348555423573586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin13479348555423573586;'/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' '[]((X(X((<>([]((LTLAPp0==true)))&&(LTLAPp1==true))))||(<>(X(X((LTLAPp2==true)))) U (LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: 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( 5/ 8), 0.248: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.248: LTL layer: formula: []((X(X((<>([]((LTLAPp0==true)))&&(LTLAPp1==true))))||(<>(X(X((LTLAPp2==true)))) U (LTLAPp1==true))))
pins2lts-mc-linux64( 5/ 8), 0.248: "[]((X(X((<>([]((LTLAPp0==true)))&&(LTLAPp1==true))))||(<>(X(X((LTLAPp2==true)))) U (LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.254: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.255: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.262: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.263: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.272: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.287: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.290: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.304: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.506: There are 726 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.506: State length is 1004, there are 737 groups
pins2lts-mc-linux64( 0/ 8), 0.506: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.506: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.506: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.506: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.576: [Blue] ~118 levels ~960 states ~4016 transitions
pins2lts-mc-linux64( 1/ 8), 0.634: [Blue] ~240 levels ~1920 states ~9288 transitions
pins2lts-mc-linux64( 6/ 8), 0.743: [Blue] ~480 levels ~3840 states ~18656 transitions
pins2lts-mc-linux64( 2/ 8), 1.012: [Blue] ~936 levels ~7680 states ~37760 transitions
pins2lts-mc-linux64( 2/ 8), 1.422: [Blue] ~1880 levels ~15360 states ~78272 transitions
pins2lts-mc-linux64( 2/ 8), 2.099: [Blue] ~3767 levels ~30720 states ~166960 transitions
pins2lts-mc-linux64( 2/ 8), 3.227: [Blue] ~7562 levels ~61440 states ~347696 transitions
pins2lts-mc-linux64( 2/ 8), 5.479: [Blue] ~15128 levels ~122880 states ~722104 transitions
pins2lts-mc-linux64( 2/ 8), 9.683: [Blue] ~30260 levels ~245760 states ~1486736 transitions
pins2lts-mc-linux64( 2/ 8), 17.132: [Blue] ~60613 levels ~491520 states ~3072088 transitions
pins2lts-mc-linux64( 2/ 8), 32.266: [Blue] ~121344 levels ~983040 states ~6420144 transitions
pins2lts-mc-linux64( 2/ 8), 62.492: [Blue] ~242897 levels ~1966080 states ~13250896 transitions
pins2lts-mc-linux64( 4/ 8), 109.268: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 109.524:
pins2lts-mc-linux64( 0/ 8), 109.524: Explored 3316358 states 26880527 transitions, fanout: 8.105
pins2lts-mc-linux64( 0/ 8), 109.524: Total exploration time 108.970 sec (108.830 sec minimum, 108.906 sec on average)
pins2lts-mc-linux64( 0/ 8), 109.524: States per second: 30434, Transitions per second: 246678
pins2lts-mc-linux64( 0/ 8), 109.524:
pins2lts-mc-linux64( 0/ 8), 109.524: State space has 14741538 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 109.524: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 109.524: blue states: 3316358 (22.50%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 109.524: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 109.524: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 109.524:
pins2lts-mc-linux64( 0/ 8), 109.524: Total memory used for local state coloring: 50.4MB
pins2lts-mc-linux64( 0/ 8), 109.524:
pins2lts-mc-linux64( 0/ 8), 109.524: Queue width: 8B, total height: 3303850, memory: 25.21MB
pins2lts-mc-linux64( 0/ 8), 109.524: Tree memory: 368.5MB, 26.2 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 109.524: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 109.524: Stored 864 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 109.524: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 109.524: Est. total memory use: 393.7MB (~1049.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13479348555423573586;'/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' '[]((X(X((<>([]((LTLAPp0==true)))&&(LTLAPp1==true))))||(<>(X(X((LTLAPp2==true)))) U (LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13479348555423573586;'/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' '[]((X(X((<>([]((LTLAPp0==true)))&&(LTLAPp1==true))))||(<>(X(X((LTLAPp2==true)))) U (LTLAPp1==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)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
70829 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,708.419,14748004,1,0,2.97437e+07,921,5186,1.02012e+08,129,8219,3741055
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1637776 ms.

BK_STOP 1717020180068

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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