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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 9.9K Apr 12 10:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 10:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 10:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 10:03 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 5.7K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 199K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 12 10:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Apr 12 10:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 7.4K 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-AN02-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717268492129

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-AN02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:01:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:01:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:01:33] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2024-06-01 19:01:33] [INFO ] Transformed 20 places.
[2024-06-01 19:01:33] [INFO ] Transformed 8 transitions.
[2024-06-01 19:01:33] [INFO ] Found NUPN structural information;
[2024-06-01 19:01:33] [INFO ] Parsed PT model containing 20 places and 8 transitions and 32 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN02-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 6 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2024-06-01 19:01:33] [INFO ] Computed 12 invariants in 6 ms
[2024-06-01 19:01:33] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 19:01:33] [INFO ] Invariant cache hit.
[2024-06-01 19:01:33] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 210 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 234 ms. Remains : 20/20 places, 8/8 transitions.
Support contains 20 out of 20 places after structural reductions.
[2024-06-01 19:01:34] [INFO ] Flatten gal took : 14 ms
[2024-06-01 19:01:34] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:01:34] [INFO ] Input system was already deterministic with 8 transitions.
RANDOM walk for 40000 steps (8891 resets) in 1506 ms. (26 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40003 steps (2219 resets) in 223 ms. (178 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2224 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2222 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
[2024-06-01 19:01:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 20/28 variables, and 24 constraints, problems are : Problem set: 3 solved, 0 unsolved in 64 ms.
Refiners :[Domain max(s): 12/20 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-PT-AN02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Sudoku-PT-AN02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 19:01:35] [INFO ] Invariant cache hit.
[2024-06-01 19:01:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 19:01:35] [INFO ] Invariant cache hit.
[2024-06-01 19:01:35] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 103 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 104 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLCardinality-02 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&X((p0 U (p1||G(p0))))))&&(p2||(!p1&&F(p0))))))'
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 19:01:35] [INFO ] Invariant cache hit.
[2024-06-01 19:01:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 19:01:35] [INFO ] Invariant cache hit.
[2024-06-01 19:01:35] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 66 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 66 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 291 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLCardinality-03 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 19:01:35] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 19:01:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 19:01:35] [INFO ] Invariant cache hit.
[2024-06-01 19:01:35] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-01 19:01:35] [INFO ] Redundant transitions in 0 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 : 12/20 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 12/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-LTLCardinality-06
Stuttering criterion allowed to conclude after 15 steps with 3 reset in 1 ms.
FORMULA Sudoku-PT-AN02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLCardinality-06 finished in 182 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)||G(F((p1||G(p2)))))))'
Support contains 16 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2024-06-01 19:01:36] [INFO ] Computed 12 invariants in 0 ms
[2024-06-01 19:01:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 19:01:36] [INFO ] Invariant cache hit.
[2024-06-01 19:01:36] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-06-01 19:01:36] [INFO ] Redundant transitions in 0 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 76 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN02-LTLCardinality-07
Product exploration explored 100000 steps with 22204 reset in 282 ms.
Product exploration explored 100000 steps with 22214 reset in 180 ms.
Computed a total of 20 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
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) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 783 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8874 resets) in 213 ms. (186 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (2221 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2222 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
[2024-06-01 19:01:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 8/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/20 variables, 4/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 20/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/28 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 52 constraints, problems are : Problem set: 1 solved, 1 unsolved in 63 ms.
Refiners :[Domain max(s): 20/20 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 16/28 variables, and 24 constraints, problems are : Problem set: 2 solved, 0 unsolved in 28 ms.
Refiners :[Domain max(s): 16/20 constraints, Positive P Invariants (semi-flows): 8/12 constraints, State Equation: 0/20 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p2 p1)), (G (OR p0 (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F p0), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (F p1)]
Knowledge based reduction with 20 factoid took 1769 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
[2024-06-01 19:01:39] [INFO ] Invariant cache hit.
[2024-06-01 19:01:40] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 19:01:40] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 19:01:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:01:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-06-01 19:01:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 19:01:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 19:01:40] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 8 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 19:01:40] [INFO ] Invariant cache hit.
[2024-06-01 19:01:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 19:01:40] [INFO ] Invariant cache hit.
[2024-06-01 19:01:40] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 19:01:40] [INFO ] Redundant transitions in 0 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 73 ms. Remains : 20/20 places, 8/8 transitions.
Computed a total of 20 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
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)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 28 steps (4 resets) in 5 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p2)]
Knowledge based reduction with 11 factoid took 414 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-06-01 19:01:41] [INFO ] Invariant cache hit.
[2024-06-01 19:01:41] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 19:01:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 19:01:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:01:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-06-01 19:01:41] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 19:01:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 19:01:41] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 22263 reset in 126 ms.
Product exploration explored 100000 steps with 22222 reset in 106 ms.
Support contains 8 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 19:01:41] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 19:01:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 19:01:41] [INFO ] Invariant cache hit.
[2024-06-01 19:01:41] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-06-01 19:01:41] [INFO ] Redundant transitions in 0 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 : 12/20 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 12/20 places, 8/8 transitions.
Treatment of property Sudoku-PT-AN02-LTLCardinality-07 finished in 5692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&F(p1))))'
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 7 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
[2024-06-01 19:01:41] [INFO ] Invariant cache hit.
[2024-06-01 19:01:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 19:01:41] [INFO ] Invariant cache hit.
[2024-06-01 19:01:41] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 105 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 : 12/20 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 12/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN02-LTLCardinality-08
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA Sudoku-PT-AN02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLCardinality-08 finished in 284 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 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 13 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 13 /20 variables (removed 7) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 13 cols
[2024-06-01 19:01:41] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 19:01:42] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 19:01:42] [INFO ] Invariant cache hit.
[2024-06-01 19:01:42] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-06-01 19:01:42] [INFO ] Redundant transitions in 0 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 : 13/20 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 13/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-LTLCardinality-09
Stuttering criterion allowed to conclude after 87 steps with 19 reset in 1 ms.
FORMULA Sudoku-PT-AN02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLCardinality-09 finished in 124 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)||(X(p1) U !p0))))'
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 1 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 19:01:42] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 19:01:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 19:01:42] [INFO ] Invariant cache hit.
[2024-06-01 19:01:42] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 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 : 12/20 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 12/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 283 ms :[true, (OR (NOT p1) p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1, (AND p1 p0), p0]
Running random walk in product with property : Sudoku-PT-AN02-LTLCardinality-10
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLCardinality-10 finished in 362 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' '!((p0 U X(X(X(X(G(p1)))))))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 13 transition count 8
Applied a total of 7 rules in 0 ms. Remains 13 /20 variables (removed 7) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 13 cols
[2024-06-01 19:01:42] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 19:01:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 19:01:42] [INFO ] Invariant cache hit.
[2024-06-01 19:01:42] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 62 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 : 13/20 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 13/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN02-LTLCardinality-11
Stuttering criterion allowed to conclude after 157 steps with 33 reset in 1 ms.
FORMULA Sudoku-PT-AN02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLCardinality-11 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 19:01:42] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 19:01:42] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 19:01:42] [INFO ] Invariant cache hit.
[2024-06-01 19:01:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-06-01 19:01:42] [INFO ] Redundant transitions in 0 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 : 12/20 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 12/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-LTLCardinality-13
Stuttering criterion allowed to conclude after 64 steps with 21 reset in 0 ms.
FORMULA Sudoku-PT-AN02-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLCardinality-13 finished in 113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 1 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
[2024-06-01 19:01:42] [INFO ] Invariant cache hit.
[2024-06-01 19:01:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 19:01:42] [INFO ] Invariant cache hit.
[2024-06-01 19:01:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 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 : 12/20 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 12/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-LTLCardinality-14
Stuttering criterion allowed to conclude after 8 steps with 3 reset in 0 ms.
FORMULA Sudoku-PT-AN02-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-LTLCardinality-14 finished in 131 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)||G(F((p1||G(p2)))))))'
[2024-06-01 19:01:43] [INFO ] Flatten gal took : 4 ms
[2024-06-01 19:01:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 19:01:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 8 transitions and 32 arcs took 4 ms.
Total runtime 9947 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Sudoku-PT-AN02-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717268503753

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
ltl formula name Sudoku-PT-AN02-LTLCardinality-07
ltl formula formula --ltl=/tmp/907/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 20 places, 8 transitions and 32 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/907/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/907/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/907/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/907/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 13 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 21, there are 19 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 73
pnml2lts-mc( 0/ 4): unique states count: 73
pnml2lts-mc( 0/ 4): unique transitions count: 230
pnml2lts-mc( 0/ 4): - self-loop count: 10
pnml2lts-mc( 0/ 4): - claim dead count: 176
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 81
pnml2lts-mc( 0/ 4): - cum. max stack depth: 15
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 81 states 356 transitions, fanout: 4.395
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 28.2 B/state, compr.: 32.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 8 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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-AN02"
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-AN02, 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-171690532700579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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