About the Execution of ITS-Tools for Sudoku-PT-AN10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.056 | 3117443.00 | 5756202.00 | 9596.40 | FFTT?TFFFFFTTFFF | normal |
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.r400-tall-171690532800643.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 Sudoku-PT-AN10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532800643
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 502K Apr 12 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 12 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 12 10:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.6M Apr 12 10:12 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 182K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 634K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 425K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 620K Apr 12 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.3M Apr 12 10:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 31K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 564K 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 Sudoku-PT-AN10-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717054867237
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 07:41:08] [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-30 07:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 07:41:08] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2024-05-30 07:41:08] [INFO ] Transformed 1300 places.
[2024-05-30 07:41:08] [INFO ] Transformed 1000 transitions.
[2024-05-30 07:41:08] [INFO ] Found NUPN structural information;
[2024-05-30 07:41:08] [INFO ] Parsed PT model containing 1300 places and 1000 transitions and 4000 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 21 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-30 07:41:09] [INFO ] Computed 300 invariants in 35 ms
[2024-05-30 07:41:09] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-30 07:41:09] [INFO ] Invariant cache hit.
[2024-05-30 07:41:10] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in LTL mode , in 1 iterations and 1450 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Support contains 1300 out of 1300 places after structural reductions.
[2024-05-30 07:41:10] [INFO ] Flatten gal took : 141 ms
[2024-05-30 07:41:10] [INFO ] Flatten gal took : 79 ms
[2024-05-30 07:41:11] [INFO ] Input system was already deterministic with 1000 transitions.
RANDOM walk for 40000 steps (457 resets) in 4934 ms. (8 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1063 ms. (37 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 5/5 properties
[2024-05-30 07:41:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1300 variables, 1300/1300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1300 variables, 300/1600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1300 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2300 variables, 1300/2900 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2300 variables, 0/2900 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/2300 variables, 0/2900 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 2900 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2961 ms.
Refiners :[Domain max(s): 1300/1300 constraints, Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1000/1300 variables, 300/600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1300 variables, 1000/1600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 2900 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5026 ms.
Refiners :[Domain max(s): 1300/1300 constraints, Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 8679ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.4 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 300/1300 places, 1000/1000 transitions.
RANDOM walk for 40000 steps (456 resets) in 3425 ms. (11 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 136545 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 4
Probabilistic random walk after 136545 steps, saw 77908 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
// Phase 1: matrix 1000 rows 300 cols
[2024-05-30 07:41:26] [INFO ] Computed 29 invariants in 38 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 29/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1000/1300 variables, 300/629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/1300 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 629 constraints, problems are : Problem set: 0 solved, 4 unsolved in 958 ms.
Refiners :[Domain max(s): 300/300 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 29/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1000/1300 variables, 300/629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 4/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 633 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45005 ms.
Refiners :[Domain max(s): 300/300 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 46187ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 300/300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 7 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 07:42:12] [INFO ] Invariant cache hit.
[2024-05-30 07:42:12] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-30 07:42:12] [INFO ] Invariant cache hit.
[2024-05-30 07:42:12] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-30 07:42:13] [INFO ] Redundant transitions in 63 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 300/300 places, 1000/1000 transitions.
FORMULA Sudoku-PT-AN10-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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)&&(!p0 U p1))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 32 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-30 07:42:13] [INFO ] Computed 300 invariants in 6 ms
[2024-05-30 07:42:14] [INFO ] Implicit Places using invariants in 788 ms returned []
[2024-05-30 07:42:14] [INFO ] Invariant cache hit.
[2024-05-30 07:42:15] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2024-05-30 07:42:15] [INFO ] Redundant transitions in 36 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2036 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-01
Product exploration timeout after 82800 steps with 1592 reset in 10001 ms.
Product exploration timeout after 82950 steps with 1595 reset in 10002 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 292 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (456 resets) in 4796 ms. (8 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1250 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1319 ms. (30 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 3/3 properties
[2024-05-30 07:44:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1200 variables, 1200/1200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1200 variables, 200/1400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1200 variables, 0/1400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 100/1300 variables, 100/1500 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1000/2300 variables, 1300/2900 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2300 variables, 0/2900 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2300 variables, 0/2900 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 2900 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2248 ms.
Refiners :[Domain max(s): 1300/1300 constraints, Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1200 variables, 1200/1200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1200 variables, 200/1400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1200 variables, 0/1400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 100/1300 variables, 100/1500 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 2900 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3544 ms.
Refiners :[Domain max(s): 1300/1300 constraints, Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 6489ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 100 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 25 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 14 factoid took 305 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLCardinality-01 finished in 123292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(!p1))||G(p2)))))'
Support contains 1300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 07:44:16] [INFO ] Invariant cache hit.
[2024-05-30 07:44:16] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-30 07:44:16] [INFO ] Invariant cache hit.
[2024-05-30 07:44:17] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
[2024-05-30 07:44:17] [INFO ] Redundant transitions in 13 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1075 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-03
Product exploration explored 100000 steps with 1148 reset in 8608 ms.
Product exploration explored 100000 steps with 1147 reset in 8661 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 740 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 40000 steps (457 resets) in 4039 ms. (9 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1829 ms. (21 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 3/3 properties
[2024-05-30 07:45:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1300 variables, 1300/1300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1300 variables, 300/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1300 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1000/2300 variables, 1300/2900 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2300 variables, 0/2900 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/2300 variables, 0/2900 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 2900 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2031 ms.
Refiners :[Domain max(s): 1300/1300 constraints, Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1000/1200 variables, 200/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1200 variables, 1000/1400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1200 variables, 0/1400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 100/1300 variables, 100/1500 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1300 variables, 100/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1300 variables, 0/1600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1000/2300 variables, 1300/2900 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 2902 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3418 ms.
Refiners :[Domain max(s): 1300/1300 constraints, Positive P Invariants (semi-flows): 300/300 constraints, State Equation: 1300/1300 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 5886ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.8 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 300/1300 places, 1000/1000 transitions.
RANDOM walk for 40000 steps (456 resets) in 4374 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 218864 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 2
Probabilistic random walk after 218864 steps, saw 96321 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
// Phase 1: matrix 1000 rows 300 cols
[2024-05-30 07:46:04] [INFO ] Computed 29 invariants in 19 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 100/300 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 100/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1000/1300 variables, 300/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1300 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1300 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 629 constraints, problems are : Problem set: 0 solved, 2 unsolved in 395 ms.
Refiners :[Domain max(s): 300/300 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 300/300 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/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 100/300 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 100/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1000/1300 variables, 300/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 631 constraints, problems are : Problem set: 0 solved, 2 unsolved in 18604 ms.
Refiners :[Domain max(s): 300/300 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 19081ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 200 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 300/300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 07:46:23] [INFO ] Invariant cache hit.
[2024-05-30 07:46:23] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-30 07:46:23] [INFO ] Invariant cache hit.
[2024-05-30 07:46:24] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1623 ms to find 0 implicit places.
[2024-05-30 07:46:24] [INFO ] Redundant transitions in 14 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1650 ms. Remains : 300/300 places, 1000/1000 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p2) p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLCardinality-03 finished in 128329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(p1||F((p2||X(p1))))))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-30 07:46:24] [INFO ] Computed 300 invariants in 7 ms
[2024-05-30 07:46:25] [INFO ] Implicit Places using invariants in 935 ms returned []
[2024-05-30 07:46:25] [INFO ] Invariant cache hit.
[2024-05-30 07:46:26] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2076 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-04
Product exploration timeout after 69150 steps with 1355 reset in 10001 ms.
Product exploration timeout after 69040 steps with 1353 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 777 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 204 steps (0 resets) in 60 ms. (3 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 1340 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
[2024-05-30 07:48:28] [INFO ] Invariant cache hit.
[2024-05-30 07:48:37] [INFO ] [Real]Absence check using 300 positive place invariants in 511 ms returned sat
[2024-05-30 07:48:40] [INFO ] [Real]Absence check using state equation in 3250 ms returned sat
[2024-05-30 07:48:40] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 07:48:44] [INFO ] Invariant cache hit.
[2024-05-30 07:48:45] [INFO ] Implicit Places using invariants in 981 ms returned []
[2024-05-30 07:48:45] [INFO ] Invariant cache hit.
[2024-05-30 07:48:46] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 2193 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2200 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 204 steps (0 resets) in 74 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-30 07:48:47] [INFO ] Invariant cache hit.
[2024-05-30 07:48:56] [INFO ] [Real]Absence check using 300 positive place invariants in 500 ms returned sat
[2024-05-30 07:48:59] [INFO ] [Real]Absence check using state equation in 3093 ms returned sat
[2024-05-30 07:48:59] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration timeout after 69180 steps with 1356 reset in 10002 ms.
Product exploration timeout after 69210 steps with 1357 reset in 10002 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 24 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 07:49:23] [INFO ] Redundant transitions in 6 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin12773109592516435511
[2024-05-30 07:49:23] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12773109592516435511
Running compilation step : cd /tmp/ltsmin12773109592516435511;'/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 2983 ms.
Running link step : cd /tmp/ltsmin12773109592516435511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin12773109592516435511;'/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/stateBased3450453570312270327.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 6 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 07:49:38] [INFO ] Invariant cache hit.
[2024-05-30 07:49:39] [INFO ] Implicit Places using invariants in 961 ms returned []
[2024-05-30 07:49:39] [INFO ] Invariant cache hit.
[2024-05-30 07:49:40] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 2182 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 2191 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin11902315599891300041
[2024-05-30 07:49:40] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11902315599891300041
Running compilation step : cd /tmp/ltsmin11902315599891300041;'/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 2813 ms.
Running link step : cd /tmp/ltsmin11902315599891300041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11902315599891300041;'/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/stateBased6396957390088969716.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 07:49:55] [INFO ] Flatten gal took : 65 ms
[2024-05-30 07:49:56] [INFO ] Flatten gal took : 62 ms
[2024-05-30 07:49:56] [INFO ] Time to serialize gal into /tmp/LTL11821418145025694153.gal : 14 ms
[2024-05-30 07:49:56] [INFO ] Time to serialize properties into /tmp/LTL8312370043462554408.prop : 5 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/LTL11821418145025694153.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15369135074830972393.hoa' '-atoms' '/tmp/LTL8312370043462554408.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/LTL8312370043462554408.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15369135074830972393.hoa
Detected timeout of ITS tools.
[2024-05-30 07:50:11] [INFO ] Flatten gal took : 57 ms
[2024-05-30 07:50:11] [INFO ] Flatten gal took : 48 ms
[2024-05-30 07:50:11] [INFO ] Time to serialize gal into /tmp/LTL13210744933855522023.gal : 10 ms
[2024-05-30 07:50:11] [INFO ] Time to serialize properties into /tmp/LTL17573645693925455541.ltl : 8 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/LTL13210744933855522023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17573645693925455541.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 : !((X(X((F("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Colum...47461
Formula 0 simplified : XX(G!"((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_...47449
Detected timeout of ITS tools.
[2024-05-30 07:50:26] [INFO ] Flatten gal took : 44 ms
[2024-05-30 07:50:26] [INFO ] Applying decomposition
[2024-05-30 07:50:26] [INFO ] Flatten gal took : 42 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/graph560566599310702408.txt' '-o' '/tmp/graph560566599310702408.bin' '-w' '/tmp/graph560566599310702408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph560566599310702408.bin' '-l' '-1' '-v' '-w' '/tmp/graph560566599310702408.weights' '-q' '0' '-e' '0.001'
[2024-05-30 07:50:30] [INFO ] Decomposing Gal with order
[2024-05-30 07:50:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 07:50:31] [INFO ] Removed a total of 1800 redundant transitions.
[2024-05-30 07:50:31] [INFO ] Flatten gal took : 1145 ms
[2024-05-30 07:50:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-30 07:50:32] [INFO ] Time to serialize gal into /tmp/LTL4389632053580158882.gal : 177 ms
[2024-05-30 07:50:32] [INFO ] Time to serialize properties into /tmp/LTL1767879915335364473.ltl : 5 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/LTL4389632053580158882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1767879915335364473.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns...73461
Formula 0 simplified : XX(G!"((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_...73449
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN10-LTLCardinality-04 finished in 262662 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(G(!p0)))'
Support contains 100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 33 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2024-05-30 07:50:47] [INFO ] Computed 29 invariants in 19 ms
[2024-05-30 07:50:48] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-05-30 07:50:48] [INFO ] Invariant cache hit.
[2024-05-30 07:50:49] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 2399 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2433 ms. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-06 finished in 2545 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(X(F(p0)))))'
Support contains 100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 19 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 07:50:50] [INFO ] Invariant cache hit.
[2024-05-30 07:50:50] [INFO ] Implicit Places using invariants in 713 ms returned []
[2024-05-30 07:50:50] [INFO ] Invariant cache hit.
[2024-05-30 07:50:52] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 2293 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2313 ms. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-07
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 10 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-07 finished in 2503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 999 places and 0 transitions.
Iterating post reduction 0 with 999 rules applied. Total rules applied 999 place count 301 transition count 1000
Applied a total of 999 rules in 27 ms. Remains 301 /1300 variables (removed 999) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 301 cols
[2024-05-30 07:50:52] [INFO ] Computed 29 invariants in 35 ms
[2024-05-30 07:50:53] [INFO ] Implicit Places using invariants in 983 ms returned []
[2024-05-30 07:50:53] [INFO ] Invariant cache hit.
[2024-05-30 07:50:55] [INFO ] Implicit Places using invariants and state equation in 1890 ms returned []
Implicit Place search using SMT with State Equation took 2877 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 301/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2905 ms. Remains : 301/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-08 finished in 3062 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&&X(G(p1))))))'
Support contains 4 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 20 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2024-05-30 07:50:55] [INFO ] Computed 29 invariants in 24 ms
[2024-05-30 07:50:56] [INFO ] Implicit Places using invariants in 985 ms returned []
[2024-05-30 07:50:56] [INFO ] Invariant cache hit.
[2024-05-30 07:50:58] [INFO ] Implicit Places using invariants and state equation in 2140 ms returned []
Implicit Place search using SMT with State Equation took 3127 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3148 ms. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-09
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 13 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-09 finished in 3301 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(G(p1))||p0)))'
Support contains 4 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 998 places and 0 transitions.
Iterating post reduction 0 with 998 rules applied. Total rules applied 998 place count 302 transition count 1000
Applied a total of 998 rules in 14 ms. Remains 302 /1300 variables (removed 998) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 302 cols
[2024-05-30 07:50:59] [INFO ] Computed 29 invariants in 45 ms
[2024-05-30 07:51:00] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2024-05-30 07:51:00] [INFO ] Invariant cache hit.
[2024-05-30 07:51:02] [INFO ] Implicit Places using invariants and state equation in 2095 ms returned []
Implicit Place search using SMT with State Equation took 3247 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 302/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3262 ms. Remains : 302/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 9502 ms.
Product exploration explored 100000 steps with 50000 reset in 9445 ms.
Computed a total of 302 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 302 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLCardinality-11 finished in 27286 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 U (p1||G(p0))))))'
Support contains 4 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 18 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2024-05-30 07:51:26] [INFO ] Computed 29 invariants in 16 ms
[2024-05-30 07:51:27] [INFO ] Implicit Places using invariants in 993 ms returned []
[2024-05-30 07:51:27] [INFO ] Invariant cache hit.
[2024-05-30 07:51:29] [INFO ] Implicit Places using invariants and state equation in 2232 ms returned []
Implicit Place search using SMT with State Equation took 3226 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3245 ms. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-13
Stuttering criterion allowed to conclude after 670 steps with 11 reset in 52 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-13 finished in 3378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(p1||F((p2||X(p1))))))))'
Found a Shortening insensitive property : Sudoku-PT-AN10-LTLCardinality-04
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-30 07:51:29] [INFO ] Computed 300 invariants in 4 ms
[2024-05-30 07:51:30] [INFO ] Implicit Places using invariants in 930 ms returned []
[2024-05-30 07:51:30] [INFO ] Invariant cache hit.
[2024-05-30 07:51:32] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 2135 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-04
Product exploration timeout after 69100 steps with 1354 reset in 10001 ms.
Product exploration timeout after 68550 steps with 1344 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 820 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 204 steps (0 resets) in 69 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 1351 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
[2024-05-30 07:53:34] [INFO ] Invariant cache hit.
[2024-05-30 07:53:42] [INFO ] [Real]Absence check using 300 positive place invariants in 503 ms returned sat
[2024-05-30 07:53:46] [INFO ] [Real]Absence check using state equation in 3370 ms returned sat
[2024-05-30 07:53:46] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 07:53:49] [INFO ] Invariant cache hit.
[2024-05-30 07:53:50] [INFO ] Implicit Places using invariants in 944 ms returned []
[2024-05-30 07:53:50] [INFO ] Invariant cache hit.
[2024-05-30 07:53:51] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2108 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 204 steps (0 resets) in 61 ms. (3 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-30 07:53:52] [INFO ] Invariant cache hit.
[2024-05-30 07:54:00] [INFO ] [Real]Absence check using 300 positive place invariants in 484 ms returned sat
[2024-05-30 07:54:04] [INFO ] [Real]Absence check using state equation in 3231 ms returned sat
[2024-05-30 07:54:04] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration timeout after 69540 steps with 1363 reset in 10002 ms.
Product exploration timeout after 69540 steps with 1363 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 20 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 07:54:28] [INFO ] Redundant transitions in 7 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin14951514438633878568
[2024-05-30 07:54:28] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14951514438633878568
Running compilation step : cd /tmp/ltsmin14951514438633878568;'/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 2701 ms.
Running link step : cd /tmp/ltsmin14951514438633878568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14951514438633878568;'/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/stateBased3462907218722902459.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-30 07:54:43] [INFO ] Invariant cache hit.
[2024-05-30 07:54:44] [INFO ] Implicit Places using invariants in 961 ms returned []
[2024-05-30 07:54:44] [INFO ] Invariant cache hit.
[2024-05-30 07:54:45] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 2171 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2176 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin15943260201638140806
[2024-05-30 07:54:45] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15943260201638140806
Running compilation step : cd /tmp/ltsmin15943260201638140806;'/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 2660 ms.
Running link step : cd /tmp/ltsmin15943260201638140806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15943260201638140806;'/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/stateBased12483525758769445640.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 07:55:00] [INFO ] Flatten gal took : 64 ms
[2024-05-30 07:55:00] [INFO ] Flatten gal took : 59 ms
[2024-05-30 07:55:00] [INFO ] Time to serialize gal into /tmp/LTL13508544313504889248.gal : 6 ms
[2024-05-30 07:55:00] [INFO ] Time to serialize properties into /tmp/LTL527611606809741480.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13508544313504889248.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16700676499043991231.hoa' '-atoms' '/tmp/LTL527611606809741480.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...318
Loading property file /tmp/LTL527611606809741480.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16700676499043991231.hoa
Detected timeout of ITS tools.
[2024-05-30 07:55:15] [INFO ] Flatten gal took : 51 ms
[2024-05-30 07:55:15] [INFO ] Flatten gal took : 41 ms
[2024-05-30 07:55:15] [INFO ] Time to serialize gal into /tmp/LTL6049017101206625080.gal : 9 ms
[2024-05-30 07:55:15] [INFO ] Time to serialize properties into /tmp/LTL8103346119739035454.ltl : 3 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/LTL6049017101206625080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8103346119739035454.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Colum...47461
Formula 0 simplified : XX(G!"((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_...47449
Detected timeout of ITS tools.
[2024-05-30 07:55:31] [INFO ] Flatten gal took : 43 ms
[2024-05-30 07:55:31] [INFO ] Applying decomposition
[2024-05-30 07:55:31] [INFO ] Flatten gal took : 41 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/graph991848145626857752.txt' '-o' '/tmp/graph991848145626857752.bin' '-w' '/tmp/graph991848145626857752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph991848145626857752.bin' '-l' '-1' '-v' '-w' '/tmp/graph991848145626857752.weights' '-q' '0' '-e' '0.001'
[2024-05-30 07:55:34] [INFO ] Decomposing Gal with order
[2024-05-30 07:55:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 07:55:35] [INFO ] Removed a total of 1800 redundant transitions.
[2024-05-30 07:55:35] [INFO ] Flatten gal took : 678 ms
[2024-05-30 07:55:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-30 07:55:35] [INFO ] Time to serialize gal into /tmp/LTL7544808198026137074.gal : 9 ms
[2024-05-30 07:55:35] [INFO ] Time to serialize properties into /tmp/LTL2899170221657171549.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7544808198026137074.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2899170221657171549.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns...73461
Formula 0 simplified : XX(G!"((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_...73449
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN10-LTLCardinality-04 finished in 261272 ms.
[2024-05-30 07:55:50] [INFO ] Flatten gal took : 55 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15987537983567001697
[2024-05-30 07:55:50] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-30 07:55:50] [INFO ] Applying decomposition
[2024-05-30 07:55:50] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:55:51] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-30 07:55:51] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:55:51] [INFO ] Flatten gal took : 38 ms
[2024-05-30 07:55:51] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-30 07:55:51] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 07:55:51] [INFO ] Built C files in 484ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15987537983567001697
Running compilation step : cd /tmp/ltsmin15987537983567001697;'/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/graph7314248459866618348.txt' '-o' '/tmp/graph7314248459866618348.bin' '-w' '/tmp/graph7314248459866618348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7314248459866618348.bin' '-l' '-1' '-v' '-w' '/tmp/graph7314248459866618348.weights' '-q' '0' '-e' '0.001'
[2024-05-30 07:55:54] [INFO ] Decomposing Gal with order
[2024-05-30 07:55:54] [INFO ] Rewriting arrays to variables to allow decomposition.
Compilation finished in 4086 ms.
Running link step : cd /tmp/ltsmin15987537983567001697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin15987537983567001697;'/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)||<>(((LTLAPp2==true)||X((LTLAPp1==true))))))))' '--buchi-type=spotba'
[2024-05-30 07:55:55] [INFO ] Removed a total of 1800 redundant transitions.
[2024-05-30 07:55:55] [INFO ] Flatten gal took : 777 ms
[2024-05-30 07:55:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-30 07:55:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality11508404718680255331.gal : 10 ms
[2024-05-30 07:55:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality5626214044010257746.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/LTLCardinality11508404718680255331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5626214044010257746.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...298
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns...73461
Formula 0 simplified : XX(G!"((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_...73449
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.121: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.121: LTL layer: formula: X(X((<>((LTLAPp0==true))&&((LTLAPp1==true)||<>(((LTLAPp2==true)||X((LTLAPp1==true))))))))
pins2lts-mc-linux64( 2/ 8), 0.121: "X(X((<>((LTLAPp0==true))&&((LTLAPp1==true)||<>(((LTLAPp2==true)||X((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.130: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.130: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.175: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.176: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.179: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.183: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.202: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.203: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.268: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.844: DFS-FIFO for weak LTL, using special progress label 1004
pins2lts-mc-linux64( 0/ 8), 0.844: There are 1005 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.844: State length is 1301, there are 1008 groups
pins2lts-mc-linux64( 0/ 8), 0.844: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.844: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.844: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.844: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 2.217: ~50 levels ~960 states ~197512 transitions
pins2lts-mc-linux64( 7/ 8), 2.257: ~50 levels ~1920 states ~198680 transitions
pins2lts-mc-linux64( 7/ 8), 2.357: ~50 levels ~3840 states ~199856 transitions
pins2lts-mc-linux64( 7/ 8), 2.583: ~50 levels ~7680 states ~204640 transitions
pins2lts-mc-linux64( 7/ 8), 2.982: ~50 levels ~15360 states ~212968 transitions
pins2lts-mc-linux64( 7/ 8), 3.867: ~50 levels ~30720 states ~229648 transitions
pins2lts-mc-linux64( 7/ 8), 5.603: ~50 levels ~61440 states ~272504 transitions
pins2lts-mc-linux64( 7/ 8), 9.239: ~50 levels ~122880 states ~415400 transitions
pins2lts-mc-linux64( 5/ 8), 16.363: ~50 levels ~245760 states ~683256 transitions
pins2lts-mc-linux64( 5/ 8), 30.187: ~50 levels ~491520 states ~1176688 transitions
pins2lts-mc-linux64( 5/ 8), 57.348: ~50 levels ~983040 states ~2188368 transitions
pins2lts-mc-linux64( 5/ 8), 112.849: ~50 levels ~1966080 states ~4439400 transitions
pins2lts-mc-linux64( 1/ 8), 224.174: ~50 levels ~3932160 states ~9388176 transitions
pins2lts-mc-linux64( 5/ 8), 452.543: ~50 levels ~7864320 states ~21584104 transitions
pins2lts-mc-linux64( 2/ 8), 797.988: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 800.620:
pins2lts-mc-linux64( 0/ 8), 800.620: mean standard work distribution: 57.7% (states) 57.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 800.620:
pins2lts-mc-linux64( 0/ 8), 800.620: Explored 10165928 states 29782202 transitions, fanout: 2.930
pins2lts-mc-linux64( 0/ 8), 800.620: Total exploration time 799.770 sec (797.150 sec minimum, 798.323 sec on average)
pins2lts-mc-linux64( 0/ 8), 800.620: States per second: 12711, Transitions per second: 37238
pins2lts-mc-linux64( 0/ 8), 800.620:
pins2lts-mc-linux64( 0/ 8), 800.620: Progress states detected: 100
pins2lts-mc-linux64( 0/ 8), 800.620: Redundant explorations: -1.3781
pins2lts-mc-linux64( 0/ 8), 800.620:
pins2lts-mc-linux64( 0/ 8), 800.620: Queue width: 8B, total height: 2306, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 800.620: Tree memory: 334.6MB, 34.0 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 800.620: Tree fill ratio (roots/leafs): 7.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 800.620: Stored 1011 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 800.620: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 800.620: Est. total memory use: 334.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15987537983567001697;'/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)||<>(((LTLAPp2==true)||X((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15987537983567001697;'/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)||<>(((LTLAPp2==true)||X((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)
ITS-tools command line returned an error code 137
[2024-05-30 08:12:54] [INFO ] Applying decomposition
[2024-05-30 08:12:54] [INFO ] Flatten gal took : 42 ms
[2024-05-30 08:12:54] [INFO ] Decomposing Gal with order
[2024-05-30 08:12:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 08:12:54] [INFO ] Removed a total of 1791 redundant transitions.
[2024-05-30 08:12:55] [INFO ] Flatten gal took : 72 ms
[2024-05-30 08:12:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-30 08:12:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality9037866474906854390.gal : 7 ms
[2024-05-30 08:12:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality10261323522494509106.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/LTLCardinality9037866474906854390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10261323522494509106.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...298
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((((((((gu202.Columns_0_0+gu203.Columns_0_1)+(gu204.Columns_0_2+gu205.Columns_0_3))+((gu206.Columns_0_4+gu207.Columns_0_5)+...64612
Formula 0 simplified : XX(G!"((((((((gu202.Columns_0_0+gu203.Columns_0_1)+(gu204.Columns_0_2+gu205.Columns_0_3))+((gu206.Columns_0_4+gu207.Columns_0_5)+(gu...64600
ITS-tools command line returned an error code 137
[2024-05-30 08:23:36] [INFO ] Flatten gal took : 40 ms
[2024-05-30 08:23:36] [INFO ] Input system was already deterministic with 1000 transitions.
[2024-05-30 08:23:36] [INFO ] Transformed 1300 places.
[2024-05-30 08:23:36] [INFO ] Transformed 1000 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 08:23:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality4284594209883839403.gal : 6 ms
[2024-05-30 08:23:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality14616360035218078049.ltl : 3 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/LTLCardinality4284594209883839403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14616360035218078049.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((F("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Colum...47461
Formula 0 simplified : XX(G!"((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_...47449
ITS-tools command line returned an error code 137
Total runtime 3115820 ms.
BK_STOP 1717057984680
--------------------
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="Sudoku-PT-AN10"
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 Sudoku-PT-AN10, 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 r400-tall-171690532800643"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN10.tgz
mv Sudoku-PT-AN10 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 '
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 ;