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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 40K Apr 12 11:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 229K Apr 12 11:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 12 11:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 400K Apr 12 11:20 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 22K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 55K Apr 12 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 305K Apr 12 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 134K Apr 12 11:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 667K Apr 12 11:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K 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 44K 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-AN04-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717268682117

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-AN04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:04:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:04:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:04:43] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-06-01 19:04:43] [INFO ] Transformed 112 places.
[2024-06-01 19:04:43] [INFO ] Transformed 64 transitions.
[2024-06-01 19:04:43] [INFO ] Found NUPN structural information;
[2024-06-01 19:04:43] [INFO ] Parsed PT model containing 112 places and 64 transitions and 256 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 112 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2024-06-01 19:04:43] [INFO ] Computed 48 invariants in 16 ms
[2024-06-01 19:04:43] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 19:04:43] [INFO ] Invariant cache hit.
[2024-06-01 19:04:44] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 379 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 406 ms. Remains : 112/112 places, 64/64 transitions.
Support contains 112 out of 112 places after structural reductions.
[2024-06-01 19:04:44] [INFO ] Flatten gal took : 28 ms
[2024-06-01 19:04:44] [INFO ] Flatten gal took : 13 ms
[2024-06-01 19:04:44] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 40000 steps (2776 resets) in 1051 ms. (38 steps per ms) remains 1/18 properties
BEST_FIRST walk for 40004 steps (120 resets) in 145 ms. (274 steps per ms) remains 1/1 properties
[2024-06-01 19:04:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 96/176 variables, and 64 constraints, problems are : Problem set: 1 solved, 0 unsolved in 62 ms.
Refiners :[Domain max(s): 32/112 constraints, Positive P Invariants (semi-flows): 32/48 constraints, State Equation: 0/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-PT-AN04-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA Sudoku-PT-AN04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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(G(p0)))'
Support contains 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 13 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-06-01 19:04:45] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 19:04:45] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 19:04:45] [INFO ] Invariant cache hit.
[2024-06-01 19:04:45] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 137 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 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 53 steps with 3 reset in 3 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-00 finished in 408 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)&&X((X(p1) U ((X(p1)&&G(p2))||X(G(p1)))))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2024-06-01 19:04:45] [INFO ] Computed 48 invariants in 1 ms
[2024-06-01 19:04:45] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 19:04:45] [INFO ] Invariant cache hit.
[2024-06-01 19:04:45] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 197 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 201 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-03 finished in 636 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||X((p1||(p0 U (p2||G(p0))))))))'
Support contains 96 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 19:04:46] [INFO ] Invariant cache hit.
[2024-06-01 19:04:46] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 19:04:46] [INFO ] Invariant cache hit.
[2024-06-01 19:04:46] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 147 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 154 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-04
Product exploration explored 100000 steps with 10000 reset in 927 ms.
Product exploration explored 100000 steps with 10000 reset in 916 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 729 ms. Reduced automaton from 2 states, 2 edges and 3 AP (stutter sensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 394 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (2779 resets) in 890 ms. (44 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (120 resets) in 461 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (120 resets) in 461 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (120 resets) in 339 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (119 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
[2024-06-01 19:04:50] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 96/96 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 96/176 variables, and 128 constraints, problems are : Problem set: 4 solved, 0 unsolved in 60 ms.
Refiners :[Domain max(s): 96/112 constraints, Positive P Invariants (semi-flows): 32/48 constraints, State Equation: 0/112 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 (NOT p2) p1)), (G (OR p0 p2 (NOT p1))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p0)]
Knowledge based reduction with 16 factoid took 1089 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:04:51] [INFO ] Invariant cache hit.
[2024-06-01 19:04:51] [INFO ] [Real]Absence check using 48 positive place invariants in 22 ms returned sat
[2024-06-01 19:04:51] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-06-01 19:04:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:04:51] [INFO ] [Nat]Absence check using 48 positive place invariants in 39 ms returned sat
[2024-06-01 19:04:52] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-01 19:04:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 19:04:52] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 80 out of 112 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 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 19:04:52] [INFO ] Invariant cache hit.
[2024-06-01 19:04:52] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 19:04:52] [INFO ] Invariant cache hit.
[2024-06-01 19:04:52] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-06-01 19:04:52] [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 142 ms. Remains : 112/112 places, 64/64 transitions.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:04:52] [INFO ] Invariant cache hit.
[2024-06-01 19:04:52] [INFO ] [Real]Absence check using 48 positive place invariants in 19 ms returned sat
[2024-06-01 19:04:53] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-06-01 19:04:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:04:53] [INFO ] [Nat]Absence check using 48 positive place invariants in 39 ms returned sat
[2024-06-01 19:04:53] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-06-01 19:04:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 19:04:53] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10000 reset in 715 ms.
Product exploration explored 100000 steps with 10000 reset in 748 ms.
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 18 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 19:04:54] [INFO ] Invariant cache hit.
[2024-06-01 19:04:55] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 19:04:55] [INFO ] Invariant cache hit.
[2024-06-01 19:04:55] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-06-01 19:04:55] [INFO ] Redundant transitions in 2 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 208 ms. Remains : 112/112 places, 64/64 transitions.
Treatment of property Sudoku-PT-AN04-LTLCardinality-04 finished in 9052 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 U (p1||G(p0))))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 19:04:55] [INFO ] Invariant cache hit.
[2024-06-01 19:04:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 19:04:55] [INFO ] Invariant cache hit.
[2024-06-01 19:04:55] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-01 19:04:55] [INFO ] Redundant transitions in 1 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 174 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-06
Product exploration explored 100000 steps with 9994 reset in 1010 ms.
Stuttering criterion allowed to conclude after 66856 steps with 6679 reset in 671 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-06 finished in 1946 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) U X(X(X(G(p1))))))'
Support contains 32 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 1 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-06-01 19:04:57] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 19:04:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 19:04:57] [INFO ] Invariant cache hit.
[2024-06-01 19:04:57] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 101 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 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-07
Stuttering criterion allowed to conclude after 99 steps with 6 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-07 finished in 335 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&&F(p1))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 49 transition count 64
Applied a total of 63 rules in 7 ms. Remains 49 /112 variables (removed 63) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 49 cols
[2024-06-01 19:04:57] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 19:04:57] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 19:04:57] [INFO ] Invariant cache hit.
[2024-06-01 19:04:57] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 129 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 : 49/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 49/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-08 finished in 283 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||F(G(p0))))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 5 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-06-01 19:04:57] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 19:04:57] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 19:04:57] [INFO ] Invariant cache hit.
[2024-06-01 19:04:57] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 137 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 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 155 ms :[false, (NOT p0), false, false]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-09
Stuttering criterion allowed to conclude after 48 steps with 8 reset in 2 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-09 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 4 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
[2024-06-01 19:04:58] [INFO ] Invariant cache hit.
[2024-06-01 19:04:58] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 19:04:58] [INFO ] Invariant cache hit.
[2024-06-01 19:04:58] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 129 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 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-14 finished in 313 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))&&F(p1))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 48 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.3 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
[2024-06-01 19:04:58] [INFO ] Invariant cache hit.
[2024-06-01 19:04:58] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 19:04:58] [INFO ] Invariant cache hit.
[2024-06-01 19:04:58] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-06-01 19:04:58] [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 : 48/112 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-15
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-15 finished in 271 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||X((p1||(p0 U (p2||G(p0))))))))'
Found a Shortening insensitive property : Sudoku-PT-AN04-LTLCardinality-04
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 96 out of 112 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2024-06-01 19:04:58] [INFO ] Computed 48 invariants in 1 ms
[2024-06-01 19:04:59] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 19:04:59] [INFO ] Invariant cache hit.
[2024-06-01 19:04:59] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 146 ms. Remains : 112/112 places, 64/64 transitions.
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-04
Product exploration explored 100000 steps with 10000 reset in 854 ms.
Product exploration explored 100000 steps with 10000 reset in 863 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 750 ms. Reduced automaton from 2 states, 2 edges and 3 AP (stutter sensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 362 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (2789 resets) in 918 ms. (43 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (120 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (120 resets) in 293 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (120 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (120 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
[2024-06-01 19:05:02] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 96/96 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 96/176 variables, and 128 constraints, problems are : Problem set: 4 solved, 0 unsolved in 56 ms.
Refiners :[Domain max(s): 96/112 constraints, Positive P Invariants (semi-flows): 32/48 constraints, State Equation: 0/112 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 (NOT p2) p1)), (G (OR p0 p2 (NOT p1))), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p0)]
Knowledge based reduction with 16 factoid took 995 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:05:03] [INFO ] Invariant cache hit.
[2024-06-01 19:05:04] [INFO ] [Real]Absence check using 48 positive place invariants in 19 ms returned sat
[2024-06-01 19:05:04] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-06-01 19:05:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:05:04] [INFO ] [Nat]Absence check using 48 positive place invariants in 40 ms returned sat
[2024-06-01 19:05:04] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-01 19:05:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 19:05:04] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 80 out of 112 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 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 19:05:04] [INFO ] Invariant cache hit.
[2024-06-01 19:05:04] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 19:05:04] [INFO ] Invariant cache hit.
[2024-06-01 19:05:04] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-06-01 19:05:04] [INFO ] Redundant transitions in 1 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 136 ms. Remains : 112/112 places, 64/64 transitions.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:05:05] [INFO ] Invariant cache hit.
[2024-06-01 19:05:05] [INFO ] [Real]Absence check using 48 positive place invariants in 19 ms returned sat
[2024-06-01 19:05:05] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-06-01 19:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:05:05] [INFO ] [Nat]Absence check using 48 positive place invariants in 39 ms returned sat
[2024-06-01 19:05:05] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-06-01 19:05:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 19:05:05] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10000 reset in 716 ms.
Stuttering criterion allowed to conclude after 52638 steps with 5263 reset in 382 ms.
Treatment of property Sudoku-PT-AN04-LTLCardinality-04 finished in 8144 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-01 19:05:06] [INFO ] Flatten gal took : 15 ms
[2024-06-01 19:05:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 19:05:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 64 transitions and 256 arcs took 3 ms.
Total runtime 23590 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Sudoku-PT-AN04-LTLCardinality-04

BK_STOP 1717272277362

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Sudoku-PT-AN04-LTLCardinality-04
ltl formula formula --ltl=/tmp/1105/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 112 places, 64 transitions and 256 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1105/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1105/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1105/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1105/ltl_0_

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

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN04.tgz
mv Sudoku-PT-AN04 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 ;