MCC'2024- Execution of r399-tall-171690530900691

About the Execution of GreatSPN+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
14760.668	2720572.00	6495506.00	4303.80	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.r399-tall-171690530900691.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 greatspnxred
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 r399-tall-171690530900691
=====================================================================

--------------------
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 1717082786647

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 15:26:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 15:26:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:26:28] [INFO ] Load time of PNML (sax parser for PT used): 345 ms
[2024-05-30 15:26:28] [INFO ] Transformed 4864 places.
[2024-05-30 15:26:28] [INFO ] Transformed 4096 transitions.
[2024-05-30 15:26:28] [INFO ] Found NUPN structural information;
[2024-05-30 15:26:28] [INFO ] Parsed PT model containing 4864 places and 4096 transitions and 16384 arcs in 485 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 133 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-05-30 15:26:28] [INFO ] Computed 768 invariants in 68 ms
[2024-05-30 15:26:30] [INFO ] Implicit Places using invariants in 1474 ms returned []
[2024-05-30 15:26:30] [INFO ] Invariant cache hit.
[2024-05-30 15:26:36] [INFO ] Implicit Places using invariants and state equation in 6185 ms returned []
Implicit Place search using SMT with State Equation took 7689 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 7757 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Support contains 4864 out of 4864 places after structural reductions.
[2024-05-30 15:26:37] [INFO ] Flatten gal took : 367 ms
[2024-05-30 15:26:37] [INFO ] Flatten gal took : 234 ms
[2024-05-30 15:26:38] [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 1618 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 899 ms. (44 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1351 ms. (29 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1294 ms. (30 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 729 ms. (54 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1078 ms. (37 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7595 ms. (5 steps per ms) remains 7/7 properties
[2024-05-30 15:26:48] [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 5032 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 5017 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 11724ms 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 65 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 66 ms. Remains : 4864/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 20761 ms. (1 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 966 ms. (41 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1452 ms. (27 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1320 ms. (30 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 777 ms. (51 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7822 ms. (5 steps per ms) remains 5/5 properties
Probabilistic random walk after 148821 steps, saw 148778 distinct states, run finished after 24147 ms. (steps per millisecond=6 ) properties seen :0
[2024-05-30 15:27:32] [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 37061 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 45038 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 83613ms 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 88 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 89 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 107 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 15:28:57] [INFO ] Invariant cache hit.
[2024-05-30 15:29:04] [INFO ] Implicit Places using invariants in 7211 ms returned []
[2024-05-30 15:29:04] [INFO ] Invariant cache hit.
[2024-05-30 15:29:17] [INFO ] Implicit Places using invariants and state equation in 13128 ms returned []
Implicit Place search using SMT with State Equation took 20344 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 20456 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 297 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 225 steps with 0 reset in 114 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-00 finished in 20954 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 34 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 15:29:18] [INFO ] Invariant cache hit.
[2024-05-30 15:29:27] [INFO ] Implicit Places using invariants in 9335 ms returned []
[2024-05-30 15:29:27] [INFO ] Invariant cache hit.
[2024-05-30 15:29:42] [INFO ] Implicit Places using invariants and state equation in 14946 ms returned []
Implicit Place search using SMT with State Equation took 24294 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 24331 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 98 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 83 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-03 finished in 24557 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 120 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 15:29:42] [INFO ] Invariant cache hit.
[2024-05-30 15:29:54] [INFO ] Implicit Places using invariants in 12070 ms returned []
[2024-05-30 15:29:54] [INFO ] Invariant cache hit.
[2024-05-30 15:30:13] [INFO ] Implicit Places using invariants and state equation in 19103 ms returned []
Implicit Place search using SMT with State Equation took 31178 ms to find 0 implicit places.
[2024-05-30 15:30:14] [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 31550 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-04
Product exploration timeout after 23810 steps with 105 reset in 10004 ms.
Product exploration timeout after 23660 steps with 104 reset in 10001 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 101 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 37 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 105 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-30 15:30:38] [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 76 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 15:30:53] [INFO ] Invariant cache hit.
[2024-05-30 15:31:05] [INFO ] Implicit Places using invariants in 11702 ms returned []
[2024-05-30 15:31:05] [INFO ] Invariant cache hit.
[2024-05-30 15:31:24] [INFO ] Implicit Places using invariants and state equation in 19142 ms returned []
Implicit Place search using SMT with State Equation took 30847 ms to find 0 implicit places.
[2024-05-30 15:31:25] [INFO ] Redundant transitions in 234 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 31169 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 102 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 33 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 21 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 107 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-30 15:31:29] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Product exploration timeout after 23530 steps with 104 reset in 10005 ms.
Product exploration timeout after 23830 steps with 105 reset in 10004 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 84 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 15:32:04] [INFO ] Invariant cache hit.
[2024-05-30 15:32:16] [INFO ] Implicit Places using invariants in 11936 ms returned []
[2024-05-30 15:32:16] [INFO ] Invariant cache hit.
[2024-05-30 15:32:36] [INFO ] Implicit Places using invariants and state equation in 19562 ms returned []
Implicit Place search using SMT with State Equation took 31503 ms to find 0 implicit places.
[2024-05-30 15:32:36] [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 31747 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-AN16-LTLCardinality-04 finished in 174195 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 27 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 15:32:36] [INFO ] Invariant cache hit.
[2024-05-30 15:32:46] [INFO ] Implicit Places using invariants in 9371 ms returned []
[2024-05-30 15:32:46] [INFO ] Invariant cache hit.
[2024-05-30 15:33:01] [INFO ] Implicit Places using invariants and state equation in 15810 ms returned []
Implicit Place search using SMT with State Equation took 25192 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 25224 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 273 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 13770 steps with 3442 reset in 10002 ms.
Product exploration timeout after 13750 steps with 3437 reset in 10008 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 121 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 238 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 22783 ms. (1 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5794 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4722 ms. (8 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1338 ms. (29 steps per ms) remains 3/3 properties
[2024-05-30 15:33:34] [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 3570 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 3068 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 7863ms 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 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.
RANDOM walk for 40000 steps (176 resets) in 20315 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4004 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 830 ms. (48 steps per ms) remains 2/2 properties
Probabilistic random walk after 136158 steps, saw 136118 distinct states, run finished after 18103 ms. (steps per millisecond=7 ) properties seen :0
[2024-05-30 15:34:06] [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 19225 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 19159 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 38998ms 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 51 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 53 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 47 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 15:34:45] [INFO ] Invariant cache hit.
[2024-05-30 15:34:55] [INFO ] Implicit Places using invariants in 9159 ms returned []
[2024-05-30 15:34:55] [INFO ] Invariant cache hit.
[2024-05-30 15:35:11] [INFO ] Implicit Places using invariants and state equation in 16251 ms returned []
Implicit Place search using SMT with State Equation took 25417 ms to find 0 implicit places.
[2024-05-30 15:35:11] [INFO ] Redundant transitions in 155 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 25634 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 163 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 277 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 321 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 34 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 15:35:12] [INFO ] Invariant cache hit.
[2024-05-30 15:35:21] [INFO ] Implicit Places using invariants in 9245 ms returned []
[2024-05-30 15:35:21] [INFO ] Invariant cache hit.
[2024-05-30 15:35:36] [INFO ] Implicit Places using invariants and state equation in 15312 ms returned []
Implicit Place search using SMT with State Equation took 24560 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 24596 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 111 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 285 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 11212 ms. (3 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 925 ms. (43 steps per ms) remains 1/1 properties
[2024-05-30 15:35:41] [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 1937 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 1958 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 3996ms 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.7 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 188 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 189 ms. Remains : 768/4864 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (176 resets) in 11388 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 948 ms. (42 steps per ms) remains 1/1 properties
Probabilistic random walk after 370539 steps, saw 370400 distinct states, run finished after 9013 ms. (steps per millisecond=41 ) properties seen :0
// Phase 1: matrix 4096 rows 768 cols
[2024-05-30 15:35:58] [INFO ] Computed 47 invariants in 531 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 3669 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 2117 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 6444ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 254 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 26 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 178 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 269 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 251 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 257 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 15060 steps with 3765 reset in 10004 ms.
Product exploration timeout after 14910 steps with 3727 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 331 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 116 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 15:36:26] [INFO ] Redundant transitions in 159 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 287 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 50 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2024-05-30 15:36:26] [INFO ] Computed 768 invariants in 29 ms
[2024-05-30 15:36:36] [INFO ] Implicit Places using invariants in 9410 ms returned []
[2024-05-30 15:36:36] [INFO ] Invariant cache hit.
[2024-05-30 15:36:52] [INFO ] Implicit Places using invariants and state equation in 16402 ms returned []
Implicit Place search using SMT with State Equation took 25824 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 25876 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-AN16-LTLCardinality-06 finished in 256212 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 23 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 15:36:52] [INFO ] Invariant cache hit.
[2024-05-30 15:36:57] [INFO ] Implicit Places using invariants in 4617 ms returned []
[2024-05-30 15:36:57] [INFO ] Invariant cache hit.
[2024-05-30 15:37:07] [INFO ] Implicit Places using invariants and state equation in 10309 ms returned []
Implicit Place search using SMT with State Equation took 14929 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 14957 ms. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-07
Product exploration timeout after 19460 steps with 9730 reset in 10001 ms.
Product exploration timeout after 19220 steps with 9610 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 19 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 38647 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.6 ms
Discarding 4095 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 171 ms. Remains 769 /4864 variables (removed 4095) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 769 cols
[2024-05-30 15:37:32] [INFO ] Computed 47 invariants in 329 ms
[2024-05-30 15:37:37] [INFO ] Implicit Places using invariants in 5640 ms returned []
[2024-05-30 15:37:37] [INFO ] Invariant cache hit.
[2024-05-30 15:38:16] [INFO ] Performed 1/769 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 15:38:48] [INFO ] Performed 3/769 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 15:39:21] [INFO ] Performed 5/769 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 15:39:53] [INFO ] Performed 7/769 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2024-05-30 15:39:53] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2024-05-30 15:39:53] [INFO ] Implicit Places using invariants and state equation in 135868 ms returned []
Implicit Place search using SMT with State Equation took 141524 ms to find 0 implicit places.
[2024-05-30 15:39:53] [INFO ] Redundant transitions in 158 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 141861 ms. Remains : 769/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 258 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 226 steps with 0 reset in 62 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-08 finished in 142217 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 137 ms. Remains 770 /4864 variables (removed 4094) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 770 cols
[2024-05-30 15:39:54] [INFO ] Computed 47 invariants in 561 ms
[2024-05-30 15:39:59] [INFO ] Implicit Places using invariants in 5751 ms returned []
[2024-05-30 15:39:59] [INFO ] Invariant cache hit.
[2024-05-30 15:40:45] [INFO ] Performed 1/770 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 15:41:17] [INFO ] Performed 3/770 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 15:41:49] [INFO ] Performed 5/770 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 15:42:21] [INFO ] Performed 7/770 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-05-30 15:42:21] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-05-30 15:42:21] [INFO ] Implicit Places using invariants and state equation in 142091 ms returned []
Implicit Place search using SMT with State Equation took 147845 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 147984 ms. Remains : 770/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 154 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 165 steps with 0 reset in 63 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-11 finished in 148225 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.4 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 134 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2024-05-30 15:42:22] [INFO ] Computed 47 invariants in 290 ms
[2024-05-30 15:42:27] [INFO ] Implicit Places using invariants in 5209 ms returned []
[2024-05-30 15:42:27] [INFO ] Invariant cache hit.
[2024-05-30 15:43:21] [INFO ] Performed 1/768 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 15:43:53] [INFO ] Performed 3/768 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 15:44:25] [INFO ] Performed 5/768 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 15:44:58] [INFO ] Performed 7/768 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-05-30 15:44:58] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-05-30 15:44:58] [INFO ] Implicit Places using invariants and state equation in 150678 ms returned []
Implicit Place search using SMT with State Equation took 155913 ms to find 0 implicit places.
[2024-05-30 15:44:58] [INFO ] Redundant transitions in 150 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 156209 ms. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 73 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 802 steps with 3 reset in 245 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-12 finished in 156551 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.16 ms
Discarding 4095 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 150 ms. Remains 769 /4864 variables (removed 4095) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 769 cols
[2024-05-30 15:44:59] [INFO ] Computed 47 invariants in 290 ms
[2024-05-30 15:45:04] [INFO ] Implicit Places using invariants in 5514 ms returned []
[2024-05-30 15:45:04] [INFO ] Invariant cache hit.
[2024-05-30 15:45:50] [INFO ] Performed 1/769 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 15:46:22] [INFO ] Performed 3/769 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 15:46:54] [INFO ] Performed 5/769 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 15:47:32] [INFO ] Performed 8/769 implicitness test of which 0 returned IMPLICIT in 134 seconds.
[2024-05-30 15:47:32] [INFO ] Timeout of Implicit test with SMT after 134 seconds.
[2024-05-30 15:47:32] [INFO ] Implicit Places using invariants and state equation in 148411 ms returned []
Implicit Place search using SMT with State Equation took 153931 ms to find 0 implicit places.
[2024-05-30 15:47:32] [INFO ] Redundant transitions in 154 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
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 154250 ms. Remains : 769/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 166 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 683 steps with 2 reset in 194 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-13 finished in 154630 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 138 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2024-05-30 15:47:33] [INFO ] Computed 47 invariants in 289 ms
[2024-05-30 15:47:38] [INFO ] Implicit Places using invariants in 5581 ms returned []
[2024-05-30 15:47:38] [INFO ] Invariant cache hit.
[2024-05-30 15:48:33] [INFO ] Performed 1/768 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 15:49:06] [INFO ] Performed 3/768 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 15:49:38] [INFO ] Performed 5/768 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 15:50:10] [INFO ] Performed 7/768 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2024-05-30 15:50:10] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2024-05-30 15:50:10] [INFO ] Implicit Places using invariants and state equation in 151484 ms returned []
Implicit Place search using SMT with State Equation took 157086 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 157225 ms. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 182 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 222 steps with 0 reset in 62 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-14 finished in 157493 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-05-30 15:50:11] [INFO ] Flatten gal took : 197 ms
[2024-05-30 15:50:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-05-30 15:50:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4864 places, 4096 transitions and 16384 arcs took 26 ms.
Total runtime 1423473 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-PT-AN16

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 4864
TRANSITIONS: 4096
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.087s, Sys 0.018s]

SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.016s, Sys 0.000s]

----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1275
MODEL NAME: /home/mcc/execution/416/model
4864 places, 4096 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1717085507219

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="greatspnxred"
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 greatspnxred"
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 r399-tall-171690530900691"
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 '' 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 ;