About the Execution of LTSMin+red for Sudoku-PT-AN16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4946.147 | 3600000.00 | 15870984.00 | 4276.30 | FTTF?T?TFFTFFFFF | 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.r536-tall-171690532900691.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 ltsminxred
Input is Sudoku-PT-AN16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532900691
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 119M
-rw-r--r-- 1 mcc users 1.6M Apr 12 12:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.8M Apr 12 12:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9M Apr 12 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 18M Apr 12 10:25 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 698K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7M Apr 12 14:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22M Apr 12 14:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7M Apr 12 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40M Apr 12 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 144K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 345K Apr 23 08:01 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 2.3M 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-AN16-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717277928714
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:38:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:38:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:38:50] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2024-06-01 21:38:50] [INFO ] Transformed 4864 places.
[2024-06-01 21:38:50] [INFO ] Transformed 4096 transitions.
[2024-06-01 21:38:50] [INFO ] Found NUPN structural information;
[2024-06-01 21:38:50] [INFO ] Parsed PT model containing 4864 places and 4096 transitions and 16384 arcs in 409 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 98 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN16-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 42 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2024-06-01 21:38:50] [INFO ] Computed 768 invariants in 53 ms
[2024-06-01 21:38:52] [INFO ] Implicit Places using invariants in 1532 ms returned []
[2024-06-01 21:38:52] [INFO ] Invariant cache hit.
[2024-06-01 21:38:58] [INFO ] Implicit Places using invariants and state equation in 5725 ms returned []
Implicit Place search using SMT with State Equation took 7283 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
Finished structural reductions in LTL mode , in 1 iterations and 7352 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Support contains 4864 out of 4864 places after structural reductions.
[2024-06-01 21:38:58] [INFO ] Flatten gal took : 338 ms
[2024-06-01 21:38:59] [INFO ] Flatten gal took : 230 ms
[2024-06-01 21:38:59] [INFO ] Input system was already deterministic with 4096 transitions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (176 resets) in 23620 ms. (1 steps per ms) remains 7/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2053 ms. (19 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1118 ms. (35 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1646 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1480 ms. (27 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 892 ms. (44 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1183 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10343 ms. (3 steps per ms) remains 7/7 properties
[2024-06-01 21:39:10] [INFO ] Invariant cache hit.
Problem AtomicPropp8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4864 variables, 4864/4864 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 5632 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5022 ms.
Refiners :[Domain max(s): 4864/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4864 variables, 4864/4864 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 5632 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5013 ms.
Refiners :[Domain max(s): 4864/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11446ms problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 67 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 20925 ms. (1 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 858 ms. (46 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1480 ms. (27 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1456 ms. (27 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 862 ms. (46 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10225 ms. (3 steps per ms) remains 5/5 properties
Probabilistic random walk after 167606 steps, saw 167558 distinct states, run finished after 27049 ms. (steps per millisecond=6 ) properties seen :0
[2024-06-01 21:39:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4864 variables, 4864/4864 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp5 is UNSAT
Solver is answering 'unknown', stopping.
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 4864/8960 variables, and 5632 constraints, problems are : Problem set: 1 solved, 4 unsolved in 36037 ms.
Refiners :[Domain max(s): 4864/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4608 variables, 4608/4608 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4608 variables, 512/5120 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4608 variables, 0/5120 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 5376 constraints, problems are : Problem set: 2 solved, 3 unsolved in 45024 ms.
Refiners :[Domain max(s): 4608/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 82290ms problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4608 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 97 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 4864/4864 places, 4096/4096 transitions.
FORMULA Sudoku-PT-AN16-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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' '!(X((p0&&F(p1))))'
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 132 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:41:21] [INFO ] Invariant cache hit.
[2024-06-01 21:41:28] [INFO ] Implicit Places using invariants in 7071 ms returned []
[2024-06-01 21:41:28] [INFO ] Invariant cache hit.
[2024-06-01 21:41:41] [INFO ] Implicit Places using invariants and state equation in 12739 ms returned []
Implicit Place search using SMT with State Equation took 19817 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 19955 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-00
Stuttering criterion allowed to conclude after 222 steps with 0 reset in 112 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-00 finished in 20366 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 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 30 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:41:42] [INFO ] Invariant cache hit.
[2024-06-01 21:41:50] [INFO ] Implicit Places using invariants in 8251 ms returned []
[2024-06-01 21:41:50] [INFO ] Invariant cache hit.
[2024-06-01 21:42:04] [INFO ] Implicit Places using invariants and state equation in 13931 ms returned []
Implicit Place search using SMT with State Equation took 22188 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 22221 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 129 steps with 0 reset in 82 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-03 finished in 22461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 88 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:42:04] [INFO ] Invariant cache hit.
[2024-06-01 21:42:15] [INFO ] Implicit Places using invariants in 11156 ms returned []
[2024-06-01 21:42:15] [INFO ] Invariant cache hit.
[2024-06-01 21:42:32] [INFO ] Implicit Places using invariants and state equation in 16904 ms returned []
Implicit Place search using SMT with State Equation took 28063 ms to find 0 implicit places.
[2024-06-01 21:42:32] [INFO ] Redundant transitions in 236 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 28407 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-04
Product exploration timeout after 22800 steps with 100 reset in 10002 ms.
Product exploration timeout after 22610 steps with 100 reset in 10002 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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 : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 18 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-06-01 21:42:57] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 86 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:43:12] [INFO ] Invariant cache hit.
[2024-06-01 21:43:23] [INFO ] Implicit Places using invariants in 10753 ms returned []
[2024-06-01 21:43:23] [INFO ] Invariant cache hit.
[2024-06-01 21:43:40] [INFO ] Implicit Places using invariants and state equation in 16745 ms returned []
Implicit Place search using SMT with State Equation took 27501 ms to find 0 implicit places.
[2024-06-01 21:43:40] [INFO ] Redundant transitions in 231 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 27831 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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 : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 16 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-06-01 21:43:45] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration timeout after 22650 steps with 100 reset in 10005 ms.
Product exploration timeout after 22630 steps with 100 reset in 10006 ms.
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 73 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:44:20] [INFO ] Invariant cache hit.
[2024-06-01 21:44:31] [INFO ] Implicit Places using invariants in 11207 ms returned []
[2024-06-01 21:44:31] [INFO ] Invariant cache hit.
[2024-06-01 21:44:47] [INFO ] Implicit Places using invariants and state equation in 16139 ms returned []
Implicit Place search using SMT with State Equation took 27350 ms to find 0 implicit places.
[2024-06-01 21:44:48] [INFO ] Redundant transitions in 148 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 27588 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-AN16-LTLCardinality-04 finished in 164122 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)||X(X(p1)))))'
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 66 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:44:48] [INFO ] Invariant cache hit.
[2024-06-01 21:44:57] [INFO ] Implicit Places using invariants in 8717 ms returned []
[2024-06-01 21:44:57] [INFO ] Invariant cache hit.
[2024-06-01 21:45:11] [INFO ] Implicit Places using invariants and state equation in 13747 ms returned []
Implicit Place search using SMT with State Equation took 22466 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 22534 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), (NOT p1), true, (AND (NOT p1) p0), p0]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-06
Product exploration timeout after 14680 steps with 3670 reset in 10006 ms.
Product exploration timeout after 14690 steps with 3672 reset in 10002 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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 p1 p0), (X (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (176 resets) in 18225 ms. (2 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4877 ms. (8 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4611 ms. (8 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 877 ms. (45 steps per ms) remains 3/3 properties
[2024-06-01 21:45:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4352 variables, 4352/4352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/4352 variables, 256/4608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4352 variables, 0/4608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 5120 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3612 ms.
Refiners :[Domain max(s): 4352/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4352 variables, 4352/4352 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4352 variables, 256/4608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4352 variables, 0/4608 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 5120 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2994 ms.
Refiners :[Domain max(s): 4352/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7473ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 48 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 17901 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4003 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 825 ms. (48 steps per ms) remains 2/2 properties
Probabilistic random walk after 115568 steps, saw 115536 distinct states, run finished after 15122 ms. (steps per millisecond=7 ) properties seen :0
[2024-06-01 21:46:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4352 variables, 4352/4352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4352 variables, 256/4608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4352 variables, 0/4608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 5120 constraints, problems are : Problem set: 0 solved, 2 unsolved in 19281 ms.
Refiners :[Domain max(s): 4352/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4352 variables, 4352/4352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4352 variables, 256/4608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4352 variables, 0/4608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 5120 constraints, problems are : Problem set: 0 solved, 2 unsolved in 19217 ms.
Refiners :[Domain max(s): 4352/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 38858ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 47 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 41 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:46:48] [INFO ] Invariant cache hit.
[2024-06-01 21:46:57] [INFO ] Implicit Places using invariants in 8322 ms returned []
[2024-06-01 21:46:57] [INFO ] Invariant cache hit.
[2024-06-01 21:47:10] [INFO ] Implicit Places using invariants and state equation in 13383 ms returned []
Implicit Place search using SMT with State Equation took 21712 ms to find 0 implicit places.
[2024-06-01 21:47:10] [INFO ] Redundant transitions in 153 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 21915 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 25 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:47:11] [INFO ] Invariant cache hit.
[2024-06-01 21:47:19] [INFO ] Implicit Places using invariants in 8529 ms returned []
[2024-06-01 21:47:19] [INFO ] Invariant cache hit.
[2024-06-01 21:47:33] [INFO ] Implicit Places using invariants and state equation in 13479 ms returned []
Implicit Place search using SMT with State Equation took 22011 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 22041 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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 p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (176 resets) in 10342 ms. (3 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 842 ms. (47 steps per ms) remains 1/1 properties
[2024-06-01 21:47:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4096/4352 variables, 256/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/4352 variables, 4096/4608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4352 variables, 0/4608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4864/8960 variables, and 5120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1916 ms.
Refiners :[Domain max(s): 4352/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 4096/4352 variables, 256/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4352 variables, 4096/4608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4352 variables, 0/4608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4864/8960 variables, and 5120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1919 ms.
Refiners :[Domain max(s): 4352/4864 constraints, Positive P Invariants (semi-flows): 768/768 constraints, State Equation: 0/4864 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3906ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 256 out of 4864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 768 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.3 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 151 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 768/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 10668 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 829 ms. (48 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 260560 steps, run timeout after 6004 ms. (steps per millisecond=43 ) properties seen :0 out of 1
Probabilistic random walk after 260560 steps, saw 260475 distinct states, run finished after 6008 ms. (steps per millisecond=43 ) properties seen :0
// Phase 1: matrix 4096 rows 768 cols
[2024-06-01 21:47:51] [INFO ] Computed 47 invariants in 520 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 507/763 variables, 42/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 507/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/768 variables, 5/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4096/4864 variables, 768/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4864 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/4864 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4864/4864 variables, and 1583 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3353 ms.
Refiners :[Domain max(s): 768/768 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 768/768 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 507/763 variables, 42/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 507/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/768 variables, 5/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 5/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4096/4864 variables, 768/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4864 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/4864 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4864/4864 variables, and 1583 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1793 ms.
Refiners :[Domain max(s): 768/768 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 768/768 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5727ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 254 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 29 ms.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration timeout after 16410 steps with 4102 reset in 10006 ms.
Product exploration timeout after 16460 steps with 4115 reset in 10005 ms.
Applying partial POR strategy [true, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 109 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:48:18] [INFO ] Redundant transitions in 153 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 274 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Support contains 4352 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 44 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2024-06-01 21:48:18] [INFO ] Computed 768 invariants in 28 ms
[2024-06-01 21:48:27] [INFO ] Implicit Places using invariants in 8659 ms returned []
[2024-06-01 21:48:27] [INFO ] Invariant cache hit.
[2024-06-01 21:48:41] [INFO ] Implicit Places using invariants and state equation in 14676 ms returned []
Implicit Place search using SMT with State Equation took 23340 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 23385 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-AN16-LTLCardinality-06 finished in 233503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4608 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 21 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 21:48:42] [INFO ] Invariant cache hit.
[2024-06-01 21:48:46] [INFO ] Implicit Places using invariants in 4161 ms returned []
[2024-06-01 21:48:46] [INFO ] Invariant cache hit.
[2024-06-01 21:48:55] [INFO ] Implicit Places using invariants and state equation in 9139 ms returned []
Implicit Place search using SMT with State Equation took 13302 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 13327 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-07
Product exploration timeout after 21040 steps with 10520 reset in 10004 ms.
Product exploration timeout after 20700 steps with 10350 reset in 10002 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
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 p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 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-AN16-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN16-LTLCardinality-07 finished in 36880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X(G((G(p3)||p2))))))))'
Support contains 6 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 769 are kept as prefixes of interest. Removing 4095 places using SCC suffix rule.7 ms
Discarding 4095 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 149 ms. Remains 769 /4864 variables (removed 4095) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 769 cols
[2024-06-01 21:49:19] [INFO ] Computed 47 invariants in 341 ms
[2024-06-01 21:49:24] [INFO ] Implicit Places using invariants in 5424 ms returned []
[2024-06-01 21:49:24] [INFO ] Invariant cache hit.
[2024-06-01 21:50:03] [INFO ] Performed 1/769 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 21:50:35] [INFO ] Performed 3/769 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 21:51:07] [INFO ] Performed 5/769 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 21:51:39] [INFO ] Performed 7/769 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-06-01 21:51:39] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-06-01 21:51:39] [INFO ] Implicit Places using invariants and state equation in 134873 ms returned []
Implicit Place search using SMT with State Equation took 140299 ms to find 0 implicit places.
[2024-06-01 21:51:39] [INFO ] Redundant transitions in 151 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 769/4864 places, 4096/4096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140615 ms. Remains : 769/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-08
Stuttering criterion allowed to conclude after 220 steps with 0 reset in 61 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-08 finished in 140932 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(p1)&&p0)))'
Support contains 4 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4094 places and 0 transitions.
Iterating post reduction 0 with 4094 rules applied. Total rules applied 4094 place count 770 transition count 4096
Applied a total of 4094 rules in 118 ms. Remains 770 /4864 variables (removed 4094) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 770 cols
[2024-06-01 21:51:40] [INFO ] Computed 47 invariants in 491 ms
[2024-06-01 21:51:45] [INFO ] Implicit Places using invariants in 5363 ms returned []
[2024-06-01 21:51:45] [INFO ] Invariant cache hit.
[2024-06-01 21:52:29] [INFO ] Performed 1/770 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 21:53:01] [INFO ] Performed 3/770 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 21:53:33] [INFO ] Performed 5/770 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 21:54:05] [INFO ] Performed 7/770 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2024-06-01 21:54:05] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2024-06-01 21:54:05] [INFO ] Implicit Places using invariants and state equation in 140462 ms returned []
Implicit Place search using SMT with State Equation took 145828 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 : 770/4864 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145948 ms. Remains : 770/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 80 steps with 0 reset in 44 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-11 finished in 146125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p2)||p1))||p0)))'
Support contains 4 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 768 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.6 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 128 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2024-06-01 21:54:06] [INFO ] Computed 47 invariants in 281 ms
[2024-06-01 21:54:11] [INFO ] Implicit Places using invariants in 4982 ms returned []
[2024-06-01 21:54:11] [INFO ] Invariant cache hit.
[2024-06-01 21:55:04] [INFO ] Performed 1/768 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 21:55:36] [INFO ] Performed 3/768 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 21:56:08] [INFO ] Performed 5/768 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 21:56:40] [INFO ] Performed 7/768 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-06-01 21:56:40] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-06-01 21:56:40] [INFO ] Implicit Places using invariants and state equation in 149651 ms returned []
Implicit Place search using SMT with State Equation took 154634 ms to find 0 implicit places.
[2024-06-01 21:56:41] [INFO ] Redundant transitions in 148 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154926 ms. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-12
Stuttering criterion allowed to conclude after 5008 steps with 22 reset in 1237 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-12 finished in 156271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(F(p0)&&G(p1)))))'
Support contains 2 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 769 are kept as prefixes of interest. Removing 4095 places using SCC suffix rule.3 ms
Discarding 4095 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 121 ms. Remains 769 /4864 variables (removed 4095) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 769 cols
[2024-06-01 21:56:42] [INFO ] Computed 47 invariants in 245 ms
[2024-06-01 21:56:47] [INFO ] Implicit Places using invariants in 5420 ms returned []
[2024-06-01 21:56:47] [INFO ] Invariant cache hit.
[2024-06-01 21:57:32] [INFO ] Performed 1/769 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 21:58:04] [INFO ] Performed 3/769 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 21:58:37] [INFO ] Performed 5/769 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 21:59:09] [INFO ] Performed 7/769 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-06-01 21:59:09] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-06-01 21:59:09] [INFO ] Implicit Places using invariants and state equation in 141481 ms returned []
Implicit Place search using SMT with State Equation took 146904 ms to find 0 implicit places.
[2024-06-01 21:59:09] [INFO ] Redundant transitions in 152 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 769/4864 places, 4096/4096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147185 ms. Remains : 769/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-13
Stuttering criterion allowed to conclude after 4063 steps with 17 reset in 959 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-13 finished in 148293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(F((!p0&&F(!p1))))&&G(!p1))||G((F(!p1)&&F(!p0))))))'
Support contains 4 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 768 transition count 4096
Applied a total of 4096 rules in 117 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2024-06-01 21:59:11] [INFO ] Computed 47 invariants in 296 ms
[2024-06-01 21:59:16] [INFO ] Implicit Places using invariants in 5216 ms returned []
[2024-06-01 21:59:16] [INFO ] Invariant cache hit.
[2024-06-01 22:00:09] [INFO ] Performed 1/768 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:00:41] [INFO ] Performed 3/768 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:01:14] [INFO ] Performed 5/768 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 22:01:46] [INFO ] Performed 7/768 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-06-01 22:01:46] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-06-01 22:01:46] [INFO ] Implicit Places using invariants and state equation in 150156 ms returned []
Implicit Place search using SMT with State Equation took 155374 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 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155492 ms. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR p1 p0), (OR p0 p1), p1, p0, p1]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-14
Stuttering criterion allowed to conclude after 397 steps with 1 reset in 108 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-14 finished in 155812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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)||X(X(p1)))))'
[2024-06-01 22:01:46] [INFO ] Flatten gal took : 172 ms
[2024-06-01 22:01:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 22:01:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4864 places, 4096 transitions and 16384 arcs took 30 ms.
Total runtime 1377191 ms.
There are residual formulas that ITS could not solve within timeout
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
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-AN16"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Sudoku-PT-AN16, 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 r536-tall-171690532900691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN16.tgz
mv Sudoku-PT-AN16 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 ;